Advertisement

A proof system for finite trees

  • Patrick Blackburn
  • Wilfried Meyer-Viol
  • Maarten de Rijke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1092)

Abstract

In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol (1994) and Blackburn and Meyer-Viol (1994). We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Backofen, R., Rogers, J., Vijay-Shanker, K.: A first-order axiomatisation of the theory of finite trees. Journal of Logic, Language and Information, 4:5–39, 1995.Google Scholar
  2. van Benthem, J., Meyer-Viol, W.: Logical Semantics of Programming. Manuscript, 1994.Google Scholar
  3. Berlage, T.: A selective undo mechanism for graphical user interfaces on command objects. ACM Transactions on Computer-Human Interaction 1(3):269–294, 1994.Google Scholar
  4. Blackburn, P., Gardent, C., Meyer-Viol, W.: Talking about trees. In Proceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics, pages 21–29, Utrecht, The Netherlands, 1993.Google Scholar
  5. Blackburn, P., Meyer-Viol, W.: Linguistics, logic and finite trees. Bulletin of the IGPL 2:2–29, 1994.Google Scholar
  6. Blackburn, P., Gardent, C.: A specification language for lexical functional grammars. In Proceedings of the 7th Conference of the European Chapter of the Association for Computational Linguistics, pages 39–44, Dublin, Ireland, 1995.Google Scholar
  7. Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science 25:95–169, 1985.Google Scholar
  8. Fischer, M.J., Ladner, R.F.: Propositional dynamic logic of regular programs. J. Comp. Syst. Sci. 18:194–211, 1979.Google Scholar
  9. Kracht, M.: Mathematical Aspects of command relations. In Proceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics, pages 240–249, Utrecht, The Netherlands, 1993.Google Scholar
  10. Kracht, M.: Syntactic codes and grammar refinement. Journal of Logic, Language and Information 4:41–60, 1995.Google Scholar
  11. Maher, M.: Complete axiomatisations of the algebras of finite, rational and infinite trees. In Proceedings of the 3rd International Symposium on Logic in Computer Science, pages 348–357, Edinburgh, Scotland, 1988.Google Scholar
  12. Goldblatt, R.: Logics of Time and Computation. 2nd edition, CSLI Lecture notes 7, Center for the Study of Language and Information, Stanford, 1992.Google Scholar
  13. Pratt, V.: Models of program logics. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pages 115–122, 1979.Google Scholar
  14. Rabin, M.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141:1–35, 1969.Google Scholar
  15. Rogers, J.: A Descriptive Approach to Language-Theoretic Complexity. Studies in Logic, Language and Information, CSLI Publications, Stanford, 1996, to appear.Google Scholar
  16. Smoryński, C.: Self Reference and Modal Logic. Springer Verlag, 1985.Google Scholar
  17. Spaan, E.: Complexity of Modal Logics. PhD thesis, University of Amsterdam, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Patrick Blackburn
    • 1
  • Wilfried Meyer-Viol
    • 2
  • Maarten de Rijke
    • 3
  1. 1.ComputerlinguistikUniversität des SaarlandesSaarbrückenGermany
  2. 2.Dept. of ComputingImperial CollegeLondonEngland
  3. 3.Dept. of Computer ScienceUniversity of WarwickCoventryEngland

Personalised recommendations