Advertisement

Cut-free display calculi for relation algebras

  • Rajeev Goré
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1258)

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.

Keywords

Structural Connective Relation Algebra Structural Rule Sequent Calculus Sequent Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBS94]
    Chris Brink, Katarina Britz, and Renate A. Schmidt. Peirce algebras. Formal Aspects of Computing, 6:339–358, 1994.Google Scholar
  2. [Bel82]
    Nuel D. Belnap Jnr. Display logic. Journal of Philosophical Logic, 11:375–417, 1982.Google Scholar
  3. [Dat83]
    C. J. Date. An Introduction to Database Systems. Addison-Wesley, 1983.Google Scholar
  4. [Dun93]
    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.Google Scholar
  5. [Gor94]
    L. Gordeev. Cut free formalization of logic with finitely many variables: Part I. In CSL-94, LNCS 933, pp 136–150. Springer, 1994.Google Scholar
  6. [Hen80]
    M. C. B. Hennessey. A proof-system for the first-order relational calculus. Journal of Computer Systems and Science, 20:96–110, 1980.Google Scholar
  7. [Kra96]
    M. Kracht. Power and weakness of the modal display calculus. H. Wansing (Ed) Proof Theory of Modal Logics, pp 93–121. Kluwer, 1996.Google Scholar
  8. [KT90]
    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.Google Scholar
  9. [Mad83]
    Roger Maddux. A sequent calculus for relational algebras. Annals of Pure and Applied Logic, 25:73–101, 1983.Google Scholar
  10. [Mad91]
    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.Google Scholar
  11. [Pra88]
    Vaughan Pratt. Dynamic Algebras as a well-behaved Fragment of Relational Algebras. In LNCS 425, pp 77–110, Springer, 1988.Google Scholar
  12. [RS93]
    P. Robinson and J. Staples. Formalizing a hierarchical structure of practical mathematical reasoning. Journal of Logic and Computation, 3:47–61, 1993.Google Scholar
  13. [Sch82]
    Wolfgang Schönfeld. Upper bounds for proof-search in a sequent calculus for relational algebras. Zeitschrift für Mathematische Logik, 28:239–246, 1982.Google Scholar
  14. [Ven91]
    Y. Venema Many-Dimensional Modal Logic. ILLC, Dept. of Mathematics and Computer Science, Amsterdam, 1991.Google Scholar
  15. [Wad75]
    W. Wadge. A complete natural deduction system for the relational calculus. Theory of Computation Report 5, Univ.of Warwick, 1975.Google Scholar
  16. [Wan94]
    Heinrich Wansing. Sequent calculi for normal modal propositional logics. Journal of Logic and Computation, 4:124–142, 1994.Google Scholar
  17. [Wan95]
    Heinrich Wansing. Strong Cut-elimination In Display Logic. Reports on Mathematical Logic, 29:117–131, 1995 (published 1996).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Rajeev Goré
    • 1
  1. 1.Automated Reasoning Project Research School of Information Sciences and EngineeringAustralian National UniversityCanberraAustralia

Personalised recommendations