MOL11 MOL11
The 11th Meeting of the Association for Mathematics of Language
August 20-21, 2009 University of Bielefeld

Program

August 20

9:00 – 9:30 Registration and Opening
9:30 – 10:15 Tim Hunter (University of Maryland)
Deriving Syntactic Properties of Arguments and Adjuncts from Neo-Davidsonian Semantics
10:15 – 11:00 Michael Cysouw (Max Planck Institute for Evolutionary Anthropology)
On the Probability Distribution of Typological Frequencies
11:00 – 11:15 Coffee Break
11:15 – 12:00 James Rogers¹, Jeffery Heinz², Gil Bailey, Matt Edlefsen, Molly Visscher,
David Wellcome, Sean Wibel (¹Earlham College & ²University of Delaware)
On Languages Piecewise Testable in the Strict Sense
12:00 – 13:00 Invited Talk
Giorgio Satta (University of Padua)
Synchronous Rewriting for Natural Language Processing
13:00 – 14:30 Lunch Break
14:30 – 15:15 Marisa Ferrara Boston (Cornell University), John T. Hale (Michigan State University), Marco Kuhlmann (Uppsala University)
Dependency Structures Derived from Minimalist Grammars
15:15 – 16:00 Gregory Kobele (Humboldt-Universität zu Berlin)
Without Remnant Movement, MGs are Context-Free
16:00 – 16:15 Coffee Break
16:15 – 17:00 Jakub Szymanik (ILLC, University of Amsterdam)
Almost all Complex Quantifiers are Simple
17:00 – 18:00 Business Meeting

There will be a conference dinner on August 20 in the restaurant Glück und Seligkeit.

August 21

10:00 – 10:45 Stephan Kepser (codecentric GmbH, Solingen)
On Monadic Second-order Theories of Multi Dominance Structures
10:45 – 11:30 Thomas Graf (UCLA)
Some Interdefinability Results for Syntactic Constraint Classes
11:30 – 11:45 Coffee Break
11:45 – 12:45 Invited Talk
Andras Kornai (Harvard University)
The algebra of lexical semantics
12:45 – 14:15 Lunch Break
14:15 – 15:00 Yusuke Kubota & Carl Pollard (Ohio State University)
Phonological Interpretation into Preordered Algebras
15:00 – 15:45 Bill Rounds (University of Michigan)
Using Feature Logic Programming to Describe Tree Adjoining Derivations
15:45 – 16:00 Closing

Alternate Papers

  • Timothy Fowler (University of Toronto) - A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus
  • Lia Mansfield, Scott Martin, Chris Worth (Ohio State University) - Word Order and the Syntax/Phonology Interface in Convergent Grammar