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 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Ebert, Christian (Επιμελητής έκδοσης), Jäger, Gerhard (Επιμελητής έκδοσης), Michaelis, Jens (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 6149
• Θέματα: Computer science.; Computer programming.; Programming languages (Electronic computers).; Computers.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Programming Languages, Compilers, Interpreters.; Programming Techniques.; Theory of Computation.; Mathematical Logic and Formal Languages.; Symbolic and Algebraic Manipulation.; Discrete Mathematics in Computer Science.

Πίνακας περιεχομένων:

• 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.