More Output

1. Models of Adjunction in Minimalist Grammars

   Graf, Thomas

   Abstract Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational …

   read more

2. Local and Transderivational Constraints in Syntax and Semantics

   Graf, Thomas

   Abstract A long-standing tension in Minimalist syntax is that between the structure-building operations Merge and Move on the one hand and the constraints restricting the shape of the structures built by said operations on the other. Proposals differ vastly in how much weight …

   read more

3. Constraints Emerge from Merge

   Graf, Thomas

   Files [pdf]

   @Misc{Graf13StonyBrooktalk,
     author    = {Graf, Thomas},
     title     = {Constraints Emerge from {M}erge},
     year      = {2013},
     note      = {Invited talk, February 12, Department of Linguistics, 
             Stony Brook University, Stony Brook, NY}
   }
   

   read more

4. Movement-Generalized Minimalist Grammars

   Graf, Thomas

   Abstract A general framework is presented that allows for Minimalist grammars to use arbitrary movement operations under the proviso that they are all definable by monadic second-order formulas over derivation trees. Lowering, sidewards movement, and clustering, among others, are the result of instantiating …

   read more

5. Movement-Generalized Minimalist Grammars

   Graf, Thomas

   Abstract A general framework is presented that allows for Minimalist grammars to use arbitrary movement operations under the proviso that they are all definable by monadic second-order formulas over derivation trees. Lowering, sidewards movement, and clustering, among others, are the result of instantiating …

   read more

6. An Algebraic Perspective on the Person Case Constraint

   Graf, Thomas

   Abstract Graf (2011) and Kobele (2011) proved independently that Minimalist grammars can express all constraints that are definable in weak monadic second-order logic (MSO), i.e. the extension of first-order logic with quantification over finite sets. The proof takes as its vantage point …

   read more

7. A Tree Transducer Model of Reference-Set Computation

   Graf, Thomas

   Abstract Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the …

   read more