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.

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.

Geert-Jan Kruijff & Richard T. Oehrle A categorial grammar is both a grammar and a type inference system. As a result of this duality, the categorial framework offers a natural setting in which to study questions of grammatical composition, both empirically and abstractly. There are affinities in this perspective, of course, to basic questions in formal language theory. But the fact that categorial grammars are type in ference systems makes possible intrinsic connections among syntactic types, syntactic type inference, semantic types, and semantic type inference, a con nection less apparent in the standard constructions of formal language theory. Fixing a system of grammatical type inference T, we may explore what gram matical phenomena are compatible with T-and equally, what grammatical phenomena are not. Equally, fixing a class of grammatical phenomena g, we may seek to ascertain what systems of type inference characterize g. This dual perspective is a strong current in the categorial literature, going back to the classical papers of Ajdukiewicz, Bar-Hillel, Curry, and Lambek.

The conference series Logical Aspects of Computational Linguistics (LACL) aims at providing a forum for the presentation and discussion of current research in all the formal and logical aspects of computational linguistics. The LACL initiative started with a workshop held in Nancy (France) in 1995. Selected papers from this event have appeared as a special issue of the Journal of Logic Language and Information, Volume 7(4), 1998. In 1996, LACL shifted to the format of an international conference. LACL’96 and ’97 were both held in Nancy (France). The proceedings appeared as volumes 1328 and 1582 of the Springer Lecture Notes in Arti cial Intelligence. This volume contains selected papers of the third international conference on Logical Aspects of Computational Linguistics (LACL’98), held in Grenoble, France, from December 14 to 16, 1998. The conference was organized by the U- versity Pierre Mend es-France (Grenoble 2) together with LORIA (Laboratoire Lorrain d’Informatique et Applications, Nancy). On the basis of 33 submitted 4-page abstracts, the Program Committee selected 19 contributions for pres- tation. In addition to the selected papers, the program featured three invited talks, by Maarten de Rijke (ILLC, Amsterdam), Makoto Kanazawa (Chiba U- versity, Japan), and Fernando Pereira (AT&T Labs). After the conference, the contributors were invited to submit a full paper for the conference proceedings.

Reviews the themes: information, information processing, representation, and computation, psychology, philosophy, linguistics, computer science, neuroscience, education, economics, evolutionary biology, anthropology.