Abstract
Semantic automata theory studies the complexity of generalized quantifiers in terms of the string languages that describe their truth conditions.
An important point has gone unnoticed so far: for most quantifiers that are determiners, these string languages are *subregular*.
Whereas quantifier phrases …

# More Output

# Subregular Morpho-Semantics: The Expressive Limits of Monomorphemic Quantifiers

Abstract Even though languages are capable of expressing very complex generalized quantifiers such as

*all but seven*and*an even number of*, the range of possible meanings for monomorphemic determiners seems to be limited to*every*,*no*,*some*, and numerals. In this talk …# Evaluating Subregular Distinctions in the Complexity of Generalized Quantifiers

Abstract Semantic automata were developed to compare the complexity of generalized quantifiers based on the complexity of the string languages that describe their truth conditions. An important point that has gone unnoticed so far is that …

# Fragments of First-Order Logic for Linguistic Structures

Abstract Logic has always played a central role in the study of natural language meaning. But logic can also be used to describe the structure of words and sentences. Recent research has revealed that these structures are so simple that they can be …

# Adjuncts, Islands, Algebra (with a Sprinkling of Semantics)

# Optimality Is Not a Race: Against a Performance-Based View of Reference-Set Computation

Abstract Reference-set constraints (RCs; also known as transderivational constraints) differ from standard well-formedness conditions in that for every tree, they compute a set of output candidates called its

*reference set*and pick from said set the optimal candidate(s) according to some economy …# Syntax, Semantics, Pragmatics: Where Do We Find Optimality?

# Optimality Conditions Could Care Less About Optimality