David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Logic Journal of the Igpl 2 (1):3-29 (1994)
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 shown with respect to the class of finite ordered binary trees. A number of decidability results follow
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Anders Søgaard & Martin Lange (2009). Polyadic Dynamic Logics for Hpsg Parsing. Journal of Logic, Language and Information 18 (2):159-198.
Similar books and articles
Giovanna Corsi (1986). Semantic Trees for Dummett's Logic LC. Studia Logica 45 (2):199-206.
Miodrag Kapetanović & Aleksandar Krapež (1987). More on Trees and Finite Satisfiability: The Taming of Terms. Notre Dame Journal of Formal Logic 28 (3):392-394.
George Boolos (1984). Trees and Finite Satisfiability: Proof of a Conjecture of Burgess. Notre Dame Journal of Formal Logic 25 (3):193-197.
Greg Restall (2005). Logic: An Introduction. Routledge.
Herman Dishkant (1986). About Finite Predicate Logic. Studia Logica 45 (4):405 - 414.
Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon (2005). Computable Categoricity of Trees of Finite Height. Journal of Symbolic Logic 70 (1):151-215.
Dmitrij Skvortsov (2004). On Intermediate Predicate Logics of Some Finite Kripke Frames, I. Levelwise Uniform Trees. Studia Logica 77 (3):295 - 323.
Fabio Bellissima & Saverio Cittadini (1999). Finite Trees in Tense Logic. Studia Logica 62 (2):121-140.
Rolf Backofen, James Rogers & K. Vijay-Shanker (1995). A First-Order Axiomatization of the Theory of Finite Trees. Journal of Logic, Language and Information 4 (1):5-39.
Added to index2010-07-26
Total downloads8 ( #192,196 of 1,410,123 )
Recent downloads (6 months)1 ( #177,589 of 1,410,123 )
How can I increase my downloads?