David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Logic, Language and Information 5 (3-4):253-277 (1996)
This paper studies the relation between some extensions of the non-associative Lambek Calculus NL and their interpretation in tree models (free groupoids). We give various examples of sequents that are valid in tree models, but not derivable in NL. We argue why tree models may not be axiomatizable if we add finitely many derivation rules to NL, and proceed to consider labeled calculi instead.We define two labeled categorial calculi, and prove soundness and completeness for interpretations that are almost the intended one, namely for tree models where some branches of some trees may be resp. all branches of all trees must be infinitely extending. Extrapolating from the experiences in our quite simple systems, we briefly discuss some problems involved with the introduction of labels in categorial grammar, and argue that many of the basic questions are not yet understood.
|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
No citations found.
Similar books and articles
Makoto Kanazawa (2010). Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars. Journal of Logic, Language and Information 19 (2):137-161.
Raffaella Bernardi (2004). Analyzing the Core of Categorial Grammar. Journal of Logic, Language and Information 13 (2):121-137.
Paul Larson (1999). An Smax Variation for One Souslin Tree. Journal of Symbolic Logic 64 (1):81 - 98.
Lucas Champollion (2011). Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete. Journal of Logic, Language and Information 20 (3):343-359.
Yael Sygal & Shuly Wintner (2009). Associative Grammar Combination Operators for Tree-Based Grammars. Journal of Logic, Language and Information 18 (3):293-316.
Stephan Kepser & Jim Rogers (2011). The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars. Journal of Logic, Language and Information 20 (3):361-384.
Philippe de Groote & Sylvain Pogodalla (2004). On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms. [REVIEW] Journal of Logic, Language and Information 13 (4):421-438.
Aravind K. Joshi & Seth Kulick (1997). Partial Proof Trees as Building Blocks for a Categorial Grammar. Linguistics and Philosophy 20 (6):637-667.
Added to index2009-01-28
Total downloads4 ( #289,172 of 1,410,465 )
Recent downloads (6 months)1 ( #177,872 of 1,410,465 )
How can I increase my downloads?