Linguistics, logic and finite trees

Patrick Blackburn, Wilfried Meyer-Viol

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review


A modal logic is developed to deal with finite ordered binary trees a they are used in (computational) 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 shown with respect to the class of finite ordered binary trees. A number of decidability results follow.
TidsskriftLogic Journal of the IGPL
Udgave nummer1
Sider (fra-til)3-29
Antal sider27
StatusUdgivet - mar. 1994
Udgivet eksterntJa


  • Feature structures
  • Fibred semantics
  • Finite trees
  • Linguistics
  • Modal logic

Citer dette