This book is intended for students in computer science, formal linguistics, mathematical logic and to colleagues interested in categorial grammars and their logical foundations. These lecture notes present categorial grammars as deductive systems, in the approach called parsing-as-deduction, and the book includes detailed proofs of their main properties. The papers are organized in topical sections on AB grammars, Lambek’s syntactic calculus, Lambek calculus and montague grammar, non-associative Lambek calculus, multimodal Lambek calculus, Lambek calculus, linear logic and proof nets and proof nets for the multimodal Lambek calculus.
Author(s): Richard Moot, Christian Retoré (auth.)
Series: Lecture Notes in Computer Science 6850
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2012
Language: English
Pages: 300
Tags: Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics); Logics and Meanings of Programs; Algorithm Analysis and Problem Complexity; Mathematical Logic and Foundations; Programming Languages, Compilers, Interpre
Front Matter....Pages -
Classical Categorial Grammars: AB Grammars....Pages 1-22
A Logic for Categorial Grammars: Lambek’s Syntactic Calculus....Pages 23-63
Lambek Calculus and Montague Grammar....Pages 65-99
The Non-associative Lambek Calculus....Pages 101-147
The Multimodal Lambek Calculus....Pages 149-191
Lambek Calculus and Linear Logic: Proof Nets as Parse Structures....Pages 193-238
Proof Nets for the Multimodal Lambek Calculus: From Theory to a Wide-Coverage Categorial Parser....Pages 239-297
Back Matter....Pages -
