The Mathematics of Language

TheAssociationforMathematicsofLanguage(MOL)istheACLspecialinterest groupdedicated to the study of MathematicalLinguistics. After its ?rst meeting in 1984, the association has been organizing meetings on a biennial basis since 1991, with locations usually alternating between Europe and the USA. This volume contains a selection of 19 papers that were presented in c- tributed talks at the 10th meeting at UCLA, Los Angeles, in 2007 and the 11th meetingattheUniversityofBielefeld,Germany,in2009. Itfurthermorecontains threepapersofinvitedspeakersfromthesemeetings. LikeeachMOLproceedings volume, this collection re?ects studies in a wide range of theoretical topics rel- ing to language and computation that the association is devoted to supporting, including papers on the intersection of computational complexity, formal l- guage theory, proof-theory, and logic as well as phonology, lexical semantics, syntax, and typology. This volume is hence of interest not only to mathem- ical linguists but to logicians, theoretical and computational linguists, and to computer scientists alike. It therefore ?ts very well in the Springer FoLLI/LNAI series and we are grateful to Michael Moortgat for suggesting this series as a place of publication. We would furthermore like to thank everyone who played a role in making thesemeetingspossibleandhelpedtomakethemasuccess,suchasthereviewers, the invited speakers,the contributors,and the people who were involvedin local organization. May 2010 Christian Ebert Gerhard Jager Jens Michaelis Organization MOL10washeldattheUniversityofCalifornia,LosAngeles,duringJuly28 30, 2007. LocalOrganizers Marcus Kracht University of California, Los Angeles Gerald Penn University of Toronto Edward P.

Unique visibility State-of-the-art research Fast-track conference proceedings

Klappentext

This volume contains a selection of papers presented at the 10th and 11th Meeting of the Association for Mathematics of Language, held in Los Angeles, CA, USA in July 2007 and in Bielefeld, Germany, in August 2009.The 19 revised papers presented together with 3 invited speeches were carefully selected from numerous submissions. The papers in this collection reflect a wide range of theoretical topics relating to language and computation including papers on the intersection of computational complexity, formal language theory, proof theory, and logic, as well as phonology, lexical semantics, syntax and typology.

Inhalt
Dependency Structures Derived from Minimalist Grammars.- Deforesting Logical Form.- On the Probability Distribution of Typological Frequencies.- A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus.- LC Graphs for the Lambek Calculus with Product.- Proof-Theoretic Semantics for a Natural Language Fragment.- Some Interdefinability Results for Syntactic Constraint Classes.- Sortal Equivalence of Bare Grammars.- Deriving Syntactic Properties of Arguments and Adjuncts from Neo-Davidsonian Semantics.- On Monadic Second-Order Theories of Multidominance Structures.- The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars.- A Formal Foundation for A and A-bar Movement.- Without Remnant Movement, MGs Are Context-Free.- The Algebra of Lexical Semantics.- Phonological Interpretation into Preordered Algebras.- Relational Semantics for the Lambek-Grishin Calculus.- Intersecting Adjectives in Syllogistic Logic.- Creation Myths of GenerativeGrammar and the Mathematics of Syntactic Structures.- On Languages Piecewise Testable in the Strict Sense.- A Note on the Complexity of Abstract Categorial Grammars.- Almost All Complex Quantifiers Are Simple.- Constituent Structure Sets I.