Theoretical Computer Science
Linguistic Applications of First Order Intuitionistic Linear Logic
Journal of Logic, Language and Information
Incremental processing and acceptability
Computational Linguistics
Tuples, discontinuity, and gapping in categorial grammar
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Proof figures and structural operators for categorial grammar
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Dutch Grammar and Processing: A Case Study in TLG
Logic, Language, and Computation
Proof Nets for Basic Discontinuous Lambek Calculus
Journal of Logic and Computation
On anaphora and the binding principles in categorial grammar
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Logic programming of the displacement calculus
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Gapping as like-category coordination
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Displacement logic for anaphora
Journal of Computer and System Sciences
| Hi-index | 0.00 |
If all dependent expressions were adjacent some variety of immediate constituent analysis would suffice for grammar, but syntactic and semantic mismatches are characteristic of natural language; indeed this is a, or the, central problem in grammar. Logical categorial grammar reduces grammar to logic: an expression is well-formed if and only if an associated sequent is a theorem of a categorial logic. The paradigmatic categorial logic is the Lambek calculus, but being a logic of concatenation the Lambek calculus can only capture discontinuous dependencies when they are peripheral. In this paper we present the displacement calculus, which is a logic of intercalation as well as concatenation and which subsumes the Lambek calculus. On the empirical side, we apply the new calculus to discontinuous idioms, quantification, VP ellipsis, medial extraction, pied-piping, appositive relativisation, parentheticals, gapping, comparative subdeletion, cross-serial dependencies, reflexivization, anaphora, dative alternation, and particle shift. On the technical side, we prove that the calculus enjoys Cut-elimination.