Computer Science – Computation and Language
Scientific paper
2010-09-16
Computer Science
Computation and Language
Appeared in: Marija Slavkovik, editor, "Proceedings of the 15th student session of the European Summer School of Logic, Langua
Scientific paper
Categorial type logics, pioneered by Lambek, seek a proof-theoretic understanding of natural language syntax by identifying categories with formulas and derivations with proofs. We typically observe an intuitionistic bias: a structural configuration of hypotheses (a constituent) derives a single conclusion (the category assigned to it). Acting upon suggestions of Grishin to dualize the logical vocabulary, Moortgat proposed the Lambek-Grishin calculus (LG) with the aim of restoring symmetry between hypotheses and conclusions. We develop a theory of labeled modal tableaux for LG, inspired by the interpretation of its connectives as binary modal operators in the relational semantics of Kurtonina and Moortgat. As a linguistic application of our method, we show that grammars based on LG are context-free through use of an interpolation lemma. This result complements that of Melissen, who proved that LG augmented by mixed associativity and -commutativity was exceeds LTAG in expressive power.
No associations
LandOfFree
Tableaux for the Lambek-Grishin calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tableaux for the Lambek-Grishin calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tableaux for the Lambek-Grishin calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-28097