SAS-Space, for world class research

Latest additions

Abstract

Linguistics, Logic and Finite Trees


A modal logic is developed to deal with finite ordered binary trees as 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.Article

Meyer-Viol, Wilfried and Blackburn, Patrick (1994) Linguistics, Logic and Finite Trees.


Item Type:Article
Additional Information:Citation: Bulletin of the IGPL : 2, 3-31.
Subjects:Philosophy
Keywords:Linguistics, Finite trees, Modal logic
Divisions:Institute of Philosophy
Collections:London Philosophy Papers
Deposited By:Repository Administrator
Date Deposited:08 Oct 2010 11:21
Last Modified:12 Oct 2010 07:42
ItemID:869
Files available for downloadg
[img]
Preview
FilenameW_Meyer-Viol_Trees.pdf
File size315Kb
Download
License termsAvailable to public
Comments Notes Tags All

Comments

Add a Comment


Close comments

Notes

Add a Note - this will be visible to you alone, while you are logged in.

Note title [optional]:

Close notes
Tag this item (You may enter a comma separated list):
Close tags

padlock
Repository Staff Only
Item control page