A graph calculus for proving intuitionistic relation algebraic equations

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, we present a diagrammatic system in which diagrams based on graphs represent binary relations and reasoning on binary relations is performed by transformations on diagrams. We proved that if a diagram D1 can be transformed into a diagram D2 using the rules of our system, under a set ∑ of hypotheses, then it is intuitionistically true that the relation defined by diagram D1 is a sub-relation of the one defined by diagram D2, under the hypotheses in ∑. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

De Freitas, R., & Viana, P. (2012). A graph calculus for proving intuitionistic relation algebraic equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7352 LNAI, pp. 324–326). https://doi.org/10.1007/978-3-642-31223-6_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free