Readings Newsletter
Become a Readings Member to make your shopping experience even easier.
Sign in or sign up for free!
You’re not far away from qualifying for FREE standard shipping within Australia
You’ve qualified for FREE standard shipping within Australia
The cart is loading…
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
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, Jager 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.
$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
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, Jager 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.