Relational logics and their applications

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

Abstract

Logics of binary relations corresponding, among others, to the class RRA of representable relation algebras and the class FRA of full relation algebras are presented together with the proof systems in the style of dual tableaux. Next, the logics are extended with relational constants interpreted as point relations. Applications of these logics to reasoning in non-classical logics are recalled. An example is given of a dual tableau proof of an equation which is RRA-valid, while not RA-valid. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Golinska-Pilarek, J., & Orlowska, E. (2006). Relational logics and their applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4342 LNAI, pp. 125–161). https://doi.org/10.1007/11964810_7

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