Complete Axiomatizations of MSO, FO(TC1) and FO(LFP1) on Finite Trees

  • Amélie Gheerbrant
  • Balder ten Cate
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5407)

Abstract

We propose axiomatizations of monadic second-order logic (MSO), monadic transitive closure logic (FO(TC1)) and monadic least fixpoint logic (FO(LFP1)) on finite node-labeled sibling-ordered trees. We show by a uniform argument, that our axiomatizations are complete, i.e., in each of our logics, every formula which is valid on the class of finite trees is provable using our axioms. We are interested in this class of structures because it allows to represent basic structures of computer science such as XML documents, linguistic parse trees and treebanks. The logics we consider are rich enough to express interesting properties such as reachability. On arbitrary structures, they are well known to be not recursively axiomatizable.

Keywords

Trees Axiomatizations Fragments of MSO Henkin semantics Ehrenfeucht-Fraïssé games Feferman-Vaught theorems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Backofen, R., Rogers, J., Vijay-Shankar, K.: A first-order axiomatization of the theory of finite trees. Journal of Logic, Language and Information 4(4), 5–39 (1995)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bosse, U.: An Ehrenfeucht-Fraïssé game for fixpoint logic and stratified fixpoint logic. In: Martini, S., Börger, E., Kleine Büning, H., Jäger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol. 702, pp. 100–114. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  3. 3.
    Calo, A., Makowsky, J.A.: The Ehrenfeucht-Fraïssé games for transitive closure. In: Nerode, A., Taitslin, M.A. (eds.) LFCS 1992. LNCS, vol. 620, pp. 57–68. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  4. 4.
    Doets, K.: Completeness and Definability: Applications of the Ehrenfeucht Game in Second-Order and Intensional Logic. PhD thesis, Universiteit van Amsterdam (1987)Google Scholar
  5. 5.
    Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin (1995)MATHGoogle Scholar
  6. 6.
    Enderton, H.: A mathematical introduction to Logic. Academic Press, New York (1972)MATHGoogle Scholar
  7. 7.
    Feferman, S., Vaught, R.: The first-order properties of algebraic systems. Fundamenta Mathematicae 47, 57–103 (1959)MathSciNetMATHGoogle Scholar
  8. 8.
    Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for web information extraction. In: Proceedings of PODS 2002, pp. 17–28 (2002)Google Scholar
  9. 9.
    Grädel, E.: On transitive closure logic. In: Kleine Büning, H., Jäger, G., Börger, E., Richter, M.M. (eds.) CSL 1991. LNCS, vol. 626, pp. 149–163. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  10. 10.
    Henkin, L.: Completeness in the theory of types. The Journal of Symbolic Logic 15(2), 81–91 (1950)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Kepser, S.: Querying linguistic treebanks with monadic second-order logic in linear time. J. of Logic, Lang. and Inf. 13(4), 457–470 (2004)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Kepser, S.: Properties of binary transitive closure logic over trees. In: Satta, G., Monachesi, P., Penn, G., Wintner, S. (eds.) Formal Grammar 2006, pp. 77–89 (2006)Google Scholar
  13. 13.
    Lafitte, G., Mazoyer, J.: Théorie des modèles et complexité. Technical report, Ecole Normale Supérieure de Lyon (1998)Google Scholar
  14. 14.
    Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic 126(1-3), 159–213 (2004)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Manzano, M.: Extensions of First-Order logic. Cambridge University Press, New York (1996)MATHGoogle Scholar
  16. 16.
    Matz, O., Schweikardt, N.: Expressive power of monadic logics on words, trees, pictures, and graphs. In: Grädel, E., Flum, J., Wilke, T. (eds.) Logic and Automata: History and Perspectives, Texts in Logic and Games, pp. 531–552. Amsterdam University Press (2007)Google Scholar
  17. 17.
    Rogers, J.: Descriptive Approach to Language - Theoretic Complexity. CSLI Publications, Stanford (1998)MATHGoogle Scholar
  18. 18.
    ten Cate, B., Marx, M.: Axiomatizing the logical core of XPath 2.0. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 134–148. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  19. 19.
    ten Cate, B., Segoufin, L.: XPath, transitive closure logic, and nested tree walking automata. In: PODS 2008: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 251–260. ACM, New York (2008)CrossRefGoogle Scholar
  20. 20.
    Tiede, H.-J., Kepser, S.: Monadic second-order logic and transitive closure logics over trees. Electron. Notes Theor. Comput. Sci. 165, 189–199 (2006)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Amélie Gheerbrant
    • 1
  • Balder ten Cate
    • 2
  1. 1.ILLCUniversiteit van AmsterdamNetherlands
  2. 2.ISLAUniversiteit van AmsterdamNetherlands

Personalised recommendations