A Completeness Result for Relation Algebra with Binders

Abstract This paper presents an axiom system to Relation Algebra with Binders. This is a hybrid formalism introduced to fix the equipollence problems in Tarski's Relational Calculus. RAB does not fill the requirements imposed by Tarski, but as it was showed that is a very interesting alternative to First-Order Logic when concerning the symbolization of statements about binary relations. The presentation of an axiomatization of RAB contributes to its development as a formalism to the inference of facts about relations. Relational calculi have been extensively applied as much in Computer Science as in Natural Language studies and the classical theory has been extended to many directions. Since RAB seems provide new perspectives on the application of both Relation Algebra and Hybrid Logic, the work in this paper could be considered as a contribution to that development.

[1]  Hans Hermes.  Term Logic with Choice Operator , 1970 .

[2]  Ildikó Sain,et al.  On the Search for a Finitizable Algebraization of First Order Logic , 2000, Log. J. IGPL.

[3]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[4]  Patrick Blackburn,et al.  Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto , 2000, Log. J. IGPL.

[5]  Maarten Marx,et al.  Hybrid logics: characterization, interpolation and complexity , 2001, Journal of Symbolic Logic.

[6]  R. Lyndon.  THE REPRESENTATION OF RELATION ALGEBRAS, II , 1956 .

[7]  Maarten Marx,et al.  Relation Algebra with Binders , 2001, J. Log. Comput..

[8]  W. W. Wadge,et al.  A Complete Natural Deduction System for the Relational Calculus , 1975 .

[9]  Roger D. Maddux,et al.  Nonfinite axiomatizability results for cylindric and relation algebras , 1989, Journal of Symbolic Logic.

[10]  Balázs Biró.  Non-Finite-Axiomatizability Results in Algebraic Logic , 1992, J. Symb. Log..

[11]  J. P. Andersen.  The Representation of Relation Algebras , 1961 .

[12]  R. Lyndon.  THE REPRESENTATION OF RELATIONAL ALGEBRAS , 1950 .

[13]  Matthew Hennessy.  A Proof System for the First-Order Relational Calculus , 1980, J. Comput. Syst. Sci..

[14]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[15]  Roger D. Maddux,et al.  A sequent calculus for relation algebras , 1983, Ann. Pure Appl. Log..

[16]  Maarten Marx,et al.  Multi-dimensional modal logic , 1997, Applied logic series.

[17]  B. Jónsson.  Varieties of relation algebras , 1982 .

[18]  maarten marx,et al.  Arrow logic and multi-modal logic , 1997 .

[19]  Wolfgang Schönfeld.  Upper Bounds for Proof-Search in a Sequent Calculus for Relational Equations , 1982, Math. Log. Q..

[20]  Leopold Löwenheim.  Über Möglichkeiten im Relativkalkül , 1915 .

[21]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[22]  Y. Venema.  A crash course in arrow logic , 1994 .

[23]  Gunther Schmidt,et al.  Relational Methods in Computer Science , 1999, Inf. Sci..