000 | 03657nam a22003975i 4500 | ||
---|---|---|---|
001 | 301904 | ||
003 | MX-SnUAN | ||
005 | 20160429155727.0 | ||
007 | cr nn 008mamaa | ||
008 | 150903s2010 gw | o |||| 0|eng d | ||
020 |
_a9783642143229 _99783642143229 |
||
024 | 7 |
_a10.1007/9783642143229 _2doi |
|
035 | _avtls000355387 | ||
039 | 9 |
_a201509030955 _bVLOAD _c201405060349 _dVLOAD _y201402191042 _zstaff |
|
040 |
_aMX-SnUAN _bspa _cMX-SnUAN _erda |
||
050 | 4 | _aQA8.9-QA10.3 | |
100 | 1 |
_aEbert, Christian. _eeditor. _9339952 |
|
245 | 1 | 4 |
_aThe Mathematics of Language : _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, 297 páginas 55 ilustraciones _brecurso en línea. |
||
336 |
_atexto _btxt _2rdacontent |
||
337 |
_acomputadora _bc _2rdamedia |
||
338 |
_arecurso en línea _bcr _2rdacarrier |
||
347 |
_aarchivo de texto _bPDF _2rda |
||
490 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6149 |
|
500 | _aSpringer eBooks | ||
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. | ||
590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
700 | 1 |
_aJÄger, Gerhard. _eeditor. _9308132 |
|
700 | 1 |
_aMichaelis, Jens. _eeditor. _9339953 |
|
710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
776 | 0 | 8 |
_iEdición impresa: _z9783642143212 |
856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-14322-9 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
942 | _c14 | ||
999 |
_c301904 _d301904 |