Anaphora and Type Logical Grammar
Type Logical Grammar is a framework that emerged from the synthesis of two traditions: Categorial Grammar from formal linguistics and substructural logics from logic. Grammatical composition is conceived as resource conscious logical deduction. Such a grammar is necessarily surface oriented and lexicalistic. The Curry-Howard correspondence supplies an elegant compositional mapping from syntax to semantics.
Anaphora does not seem to fit well into this framework. In type logical deductions, each resource is used exactly once. Anaphora, however, is a phenomenon where semantic resources are used more than once. Generally admitting the multiple use of lexical resources is not possible because it would lead to empirical inadequacy and computational intractability.
This book develops a hybrid architecture that allows to incorporate anaphora resolution into grammatical deduction while avoiding these consequences. To this end, the grammar logic is enriched with a connective that specifically deals with anaphora.
After giving a self-contained introduction into Type Logical Grammar in general, the book discusses the formal properties of this connective. In the sequel, Jäger applies this machinery to numerous linguistic phenomena pertaining to the interaction of pronominal anaphora, VP ellipsis and quantification. In the final chapter, the framework is extended to indefiniteness, specificity and sluicing.
What people are saying - Write a review
TYPE LOGICAL GRAMMAR THE FRAMEWORK
2 Combinators and Type Logical Grammar
3 Historical and Bibliographical Remarks
THE PROBLEM OF ANAPHORA
2 Variables in TLG
3 Previous Categorial Approaches to Anaphora
LAMBEK CALCULUS WITH LIMITED CONTRACTION
VERB PHRASE ELLIPSIS
The Basic Idea
3 Interaction with Pronominal Anaphora
4 Interaction of VPE and Quantification
5 VPE and Polymorphism
6 Parallelism Versus Source Ambiguity
2 Dekkers Predicate Logic with Anaphora
3 The Logic LLC
4 Relation to Jacobsons System
PRONOUNS AND QUANTIFICATION
2 Binding by whoperators
3 Binding by Quantifiers
4 Weak Crossover
6 Backward Binding and Reconstruction