TY  - BOOK
AU  - Ebert,Christian
AU  - J�ger,Gerhard
AU  - Michaelis,Jens
ED  - SpringerLink (Online service)
TI  - The Mathematics of Language: 10th and 11th Biennial Conference, MOL 10, Los Angeles, CA, USA, July 28-30, 2007, and MOL 11, Bielefeld, Germany, August 20-21, 2009, Revised Selected Papers 
T2  - Lecture Notes in Computer Science,
SN  - 9783642143229
AV  - QA76.7-76.73 
U1  - 005.13 23
PY  - 2010///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer programming
KW  - Programming languages (Electronic computers)
KW  - Computers
KW  - Mathematical logic
KW  - Mathematics
KW  - Computer Science
KW  - Programming Languages, Compilers, Interpreters
KW  - Programming Techniques
KW  - Theory of Computation
KW  - Mathematical Logic and Formal Languages
KW  - Symbolic and Algebraic Manipulation
KW  - Discrete Mathematics in Computer Science
N1  - 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 Generative Grammar 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
UR  - http://dx.doi.org/10.1007/978-3-642-14322-9
ER  -