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
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03543nam a22006015i 4500
001 978-3-642-14322-9
003 DE-He213
005 20151204142044.0
007 cr nn 008mamaa
008 100729s2010 gw | s |||| 0|eng d
020 |a 9783642143229  |9 978-3-642-14322-9 
024 7 |a 10.1007/978-3-642-14322-9  |2 doi 
040 |d GrThAP 
050 4 |a QA76.7-76.73 
050 4 |a QA76.76.C65 
072 7 |a UMX  |2 bicssc 
072 7 |a UMC  |2 bicssc 
072 7 |a COM051010  |2 bisacsh 
072 7 |a COM010000  |2 bisacsh 
082 0 4 |a 005.13  |2 23 
245 1 4 |a The Mathematics of Language  |h [electronic resource] :  |b 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 /  |c edited by Christian Ebert, Gerhard Jäger, Jens Michaelis. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a VIII, 297 p. 55 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6149 
505 0 |a 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. 
650 0 |a Computer science. 
650 0 |a Computer programming. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Computers. 
650 0 |a Mathematical logic. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Symbolic and Algebraic Manipulation. 
650 2 4 |a Discrete Mathematics in Computer Science. 
700 1 |a Ebert, Christian.  |e editor. 
700 1 |a Jäger, Gerhard.  |e editor. 
700 1 |a Michaelis, Jens.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642143212 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6149 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-14322-9  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)