Research on Language and Computation

, Volume 1, Issue 3, pp 265–305

Syntactic Structures as Multi-dimensional Trees

  • James Rogers

DOI: 10.1023/A:1024695608419

Cite this article as:
Rogers, J. Research on Language and Computation (2003) 1: 265. doi:10.1023/A:1024695608419


We survey a sequence of results relating model-theoretic and language-theoreticdefinability over an infinite hierarchy of multi-dimensional tree-like structures and explore their applications to a corresponding range of theoriesof syntax. We discuss, in particular, results for Government and Binding Theory(GB), Tree-Adjoining Grammar (TAG) and Generalized Phrase-Structure Grammar(GPSG) along with a generalized version of TAG extending TAG in much the sameway that GPSG extends CFLs. In addition, we look at a hierarchy oflanguage classes, Weir's version of the Control Language Hierarchy, which ischaracterized by definability in our hierarchy and speculate on possiblelinguistic significance of higher levels of these hierarchies.

automatacontrol languagesGBGPSGgrammarsSyntaxTAGtreeswMSO theories

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • James Rogers
    • 1
  1. 1.Department of Computer ScienceEarlham CollegeRichmondUSA (E-mail