Research on Language and Computation

, Volume 7, Issue 1, pp 41–54

Monadic Second-Order Logic and Transitive Closure Logics Over Trees


DOI: 10.1007/s11168-009-9060-3

Cite this article as:
Tiede, HJ. & Kepser, S. Res on Lang and Comput (2009) 7: 41. doi:10.1007/s11168-009-9060-3


Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical formalisms. The central tool for model theoretic syntax has been monadic second-order logic (MSO). Much of the recent research in this area has been concerned with finding more expressive logics to capture the derivation trees of grammar formalisms that generate non-context-free languages. The motivation behind this search for more expressive logics is to describe formally certain mildly context-sensitive phenomena of natural languages. Several extensions to MSO have been proposed, most of which no longer define the derivation trees of grammar formalisms directly, while others introduce logically odd restrictions. We therefore propose to consider first-order transitive closure logic. In this logic, derivation trees can be defined in a direct way. Our main result is that transitive closure logic, even deterministic transitive closure logic, is more expressive in defining classes of tree languages than MSO. (Deterministic) transitive closure logics are capable of defining non-regular tree languages that are of interest to linguistics.


Tree languagesMonadic second-order logicTransitive closure logicsCross-serial dependenciesModel theoretic syntax

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceIllinois Wesleyan UniversityBloomingtonUSA
  2. 2.Collaborative Research Centre 441University of TübingenTübingenGermany