000 04030nam a22005775i 4500
001 978-3-642-14322-9
003 DE-He213
005 20140220084542.0
007 cr nn 008mamaa
008 100729s2010 gw | s |||| 0|eng d
020 _a9783642143229
_9978-3-642-14322-9
024 7 _a10.1007/978-3-642-14322-9
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
100 1 _aEbert, Christian.
_eeditor.
245 1 4 _aThe Mathematics of Language
_h[electronic resource] :
_b10th 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 /
_cedited by Christian Ebert, Gerhard Jäger, Jens Michaelis.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aVIII, 297p. 55 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6149
505 0 _aDependency 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aLogic design.
650 0 _aComputational complexity.
650 0 _aAlgebra
_xData processing.
650 1 4 _aComputer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aTheory of Computation.
650 2 4 _aMathematics of Computing.
700 1 _aJäger, Gerhard.
_eeditor.
700 1 _aMichaelis, Jens.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642143212
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6149
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-14322-9
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112452
_d112452