Switch to: Citations

Add references

You must login to add references.
  1. Generalized Phrase Structure Grammar.G. Gazdar, E. Klein, G. Pullum & I. Sag - 1987 - Linguistics and Philosophy 10 (3):389-426.
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • Generalized Phrase Structure Grammar.Gerald Gazdar, Ewan Klein, Geoffrey Pullum & Ivan Sag - 1989 - Philosophical Review 98 (4):556-566.
    Download  
     
    Export citation  
     
    Bookmark   112 citations  
  • (1 other version)Review: Michael O. Rabin, Decidability of Second-order Theories and Automata on Infinite Trees. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618-619.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • (1 other version)Review: John Doner, Tree Acceptors and Some of their Applications. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):619-619.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Monadic PHI ¹1-theories of PHI ¹1-properties.Kees Doets - 1989 - Notre Dame Journal of Formal Logic 30:224-240.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Monadic $\Pi^11$-theories of $\Pi1^1$}-properties.Kees Doets - 1989 - Notre Dame Journal of Formal Logic 30 (2):224-240.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Antisymmetry of Syntax.Richard S. Kayne - 1994 - MIT Press.
    The Antisymmetry of Syntax proposes a restrictive theory of word order and phrase structure that denies this assumption.
    Download  
     
    Export citation  
     
    Bookmark   124 citations  
  • Linguistics, Logic and Finite Trees.Patrick Blackburn & Wilfried Meyer-Viol - 1994 - Logic Journal of the IGPL 2 (1):3-29.
    A modal logic is developed to deal with finite ordered binary trees a they are used in linguistics. A modal language is introduced with operators for the ‘mother of’, ‘first daughter of’ and ‘second daughter of’ relations together with their transitive reflexive closures. The relevant class of tree models is defined and three linguistic applications of this language are discussed: context free grammars, command relations, and trees decorated with feature structures. An axiomatic proof system is given for which completeness is (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations