A proof system for finite trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1092, Issue , 1996, Pages 86-105

  Blackburn, Patrick ^a   Meyer Viol, Wilfried ^b   De Rijke, Maarten ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

DESCRIPTION LANGUAGES; FINITE TREES; MODAL LOGIC; PROOF SYSTEM; PROVABILITY LOGIC; SATISFIABILITY PROBLEMS; SOUND AND COMPLETE;

COMPUTER CIRCUITS;

EID: 84957638317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61377-3_33     Document Type: Conference Paper

References (17)

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.
2. van Benthem, J., Meyer-Viol, W.: Logical Semantics o/ Programming. Manuscript, 1994.
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.
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 Netherlazads, 1993.
5. Blackburn, P., Meyer-Viol, W.: Linguistics, logic and finite trees. Bulletin of the IGPL 2:2-29, 1994.
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.
7. Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science 25:95-169, 1985.
8. Fischer, M.J., Ladner, R.F.: Propositional dynamic logic of regular programs. J. Comp. Syst. Sci. 18:194-211, 1979.
9. th Conference of the European Chapter of the Association for Computational Linguistics, pages 240-249, Utrecht, The Netherlands, 1993.
10. Kracht, M.: Syntactic codes and grammar refinement. Journal of Logic, Language and Information 4: 41-60, 1995.
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.
12. Goldblatt, R.: Logics of Time and Computation. 2nd edition, CSLI Lecture notes 7, Center for the Study of Language and Information, Stanford, 1992.
13. Pratt, V.: Models of program logics. In Proceedings of the POth IEEE Symposium on Foundations of Computer Science, pages 115-122, 1979.
14. Rabin, M.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141:1-35, 1969.
15. Rogers, J.: A Descriptive Approach to Language-Theoretic Complexity. Studies in Logic, Language and Information, CSLI Publications, Stanford, 1996, to appear.
16. Smoryfiski, C.: Self Reference and Modal Logic. Springer Verlag, 1985.
17. Spaan, E.: Complexity of Modal Logics. PhD thesis, University of Amsterdam, 1993.