04464nam 22008055 450 991048449230332120230401012010.03-642-14322-910.1007/978-3-642-14322-9(CKB)2670000000036331(SSID)ssj0000446617(PQKBManifestationID)11312209(PQKBTitleCode)TC0000446617(PQKBWorkID)10497898(PQKB)11254918(DE-He213)978-3-642-14322-9(MiAaPQ)EBC3065592(PPN)149018460(EXLCZ)99267000000003633120100729d2010 u| 0engurnn|008mamaatxtccrThe 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 /edited by Christian Ebert, Gerhard Jäger, Jens Michaelis1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (VIII, 297 p. 55 illus.) Lecture Notes in Artificial Intelligence,2945-9141 ;6149Bibliographic Level Mode of Issuance: Monograph3-642-14321-0 Includes bibliographical references and index.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.Lecture Notes in Artificial Intelligence,2945-9141 ;6149Compilers (Computer programs)Computer programmingComputer scienceMachine theoryComputer science—MathematicsDiscrete mathematicsCompilers and InterpretersProgramming TechniquesTheory of ComputationFormal Languages and Automata TheorySymbolic and Algebraic ManipulationDiscrete Mathematics in Computer ScienceCompilers (Computer programs).Computer programming.Computer science.Machine theory.Computer science—Mathematics.Discrete mathematics.Compilers and Interpreters.Programming Techniques.Theory of Computation.Formal Languages and Automata Theory.Symbolic and Algebraic Manipulation.Discrete Mathematics in Computer Science.410.1/51Ebert Christianedthttp://id.loc.gov/vocabulary/relators/edtJäger Gerhardedthttp://id.loc.gov/vocabulary/relators/edtMichaelis Jensedthttp://id.loc.gov/vocabulary/relators/edtMeeting on Mathematics of Language(10th :2007 July 28-30 :Los Angeles, Calif.)Meeting on Mathematics of Language(11th :2007 July 28-30 :Los Angeles, Calif.)Meeting on Mathematics of Language(2009 Aug. 20-21 :Bielefeld, Germany)BOOK9910484492303321The Mathematics of Language2831613UNINA