Abstract
We extend Belnap's Display Logic to give a cut-free Gentzen-style calculus for relation algebras. The calculus gives many axiomatic extensions of relation algebras by the addition of further structural rules. It also appears to be the first purely prepositional Gentzen-style calculus for relation algebras.
This work partly supported by a Visiting Fellowship from the Institute of Applied Mathematics and Computer Science, University of Bern, Switzerland.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Chris Brink, Katarina Britz, and Renate A. Schmidt. Peirce algebras. Formal Aspects of Computing, 6:339–358, 1994.
Nuel D. Belnap Jnr. Display logic. Journal of Philosophical Logic, 11:375–417, 1982.
C. J. Date. An Introduction to Database Systems. Addison-Wesley, 1983.
J. Michael Dunn. A representation of relation algebras using Routley-Meyer frames. Technical Report IULG-93-28, Dept. of Philosophy and Computer Science, Indiana University, USA, 1993.
L. Gordeev. Cut free formalization of logic with finitely many variables: Part I. In CSL-94, LNCS 933, pp 136–150. Springer, 1994.
M. C. B. Hennessey. A proof-system for the first-order relational calculus. Journal of Computer Systems and Science, 20:96–110, 1980.
M. Kracht. Power and weakness of the modal display calculus. H. Wansing (Ed) Proof Theory of Modal Logics, pp 93–121. Kluwer, 1996.
D. Kozen and J. Tiuryn. Logics of programs. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, chapter 14. MIT Press, 1990.
Roger Maddux. A sequent calculus for relational algebras. Annals of Pure and Applied Logic, 25:73–101, 1983.
R. D. Maddux. The origin of relation algebras in the development and axiomatization of the calculus of relations. Studia Logica, 50(3/4):421–455, 1991.
Vaughan Pratt. Dynamic Algebras as a well-behaved Fragment of Relational Algebras. In LNCS 425, pp 77–110, Springer, 1988.
P. Robinson and J. Staples. Formalizing a hierarchical structure of practical mathematical reasoning. Journal of Logic and Computation, 3:47–61, 1993.
Wolfgang Schönfeld. Upper bounds for proof-search in a sequent calculus for relational algebras. Zeitschrift für Mathematische Logik, 28:239–246, 1982.
Y. Venema Many-Dimensional Modal Logic. ILLC, Dept. of Mathematics and Computer Science, Amsterdam, 1991.
W. Wadge. A complete natural deduction system for the relational calculus. Theory of Computation Report 5, Univ.of Warwick, 1975.
Heinrich Wansing. Sequent calculi for normal modal propositional logics. Journal of Logic and Computation, 4:124–142, 1994.
Heinrich Wansing. Strong Cut-elimination In Display Logic. Reports on Mathematical Logic, 29:117–131, 1995 (published 1996).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goré, R. (1997). Cut-free display calculi for relation algebras. In: van Dalen, D., Bezem, M. (eds) Computer Science Logic. CSL 1996. Lecture Notes in Computer Science, vol 1258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63172-0_40
Download citation
DOI: https://doi.org/10.1007/3-540-63172-0_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63172-9
Online ISBN: 978-3-540-69201-0
eBook Packages: Springer Book Archive