000 03891nam a22006255i 4500
001 978-3-642-14322-9
003 DE-He213
005 20240730192014.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 _aQA76.76.C65
072 7 _aUMC
_2bicssc
072 7 _aCOM010000
_2bisacsh
072 7 _aUMC
_2thema
082 0 4 _a005.45
_223
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.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aVIII, 297 p. 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 Artificial Intelligence,
_x2945-9141 ;
_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 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.
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer programming.
_94169
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9148207
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aCompilers and Interpreters.
_931853
650 2 4 _aProgramming Techniques.
_9148208
650 2 4 _aTheory of Computation.
_9148209
650 2 4 _aFormal Languages and Automata Theory.
_9148210
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
700 1 _aEbert, Christian.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148211
700 1 _aJäger, Gerhard.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148212
700 1 _aMichaelis, Jens.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148213
710 2 _aSpringerLink (Online service)
_9148214
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642143212
776 0 8 _iPrinted edition:
_z9783642143236
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v6149
_9148215
856 4 0 _uhttps://doi.org/10.1007/978-3-642-14322-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94023
_d94023