A typology of negation in a constraint-based framework of syntax and semantics

Abstract

Negation and negative indefinites raise problems for the principle of compositionality of meaning, because we find both double and single negation readings in natural languages. De Swart and Sag (2002) solve the compositionality problem in a polyadic quantifier framework. All negative quantifiers are collected into an N-store, and are interpreted by means of iteration (double negation) or resumption (negative concord) upon retrieval. This paper extends the earlier analysis with a typology of negation and negative indefinites using bi-directional optimality theory (OT). The constraints defined are universal, but their ranking varies from one language to the next. In negative concord languages, the functional motivation for the marking of ‘negative variables’ wins out. Double negation languages value first-order iteration. The bi-directional set-up is essential, for syntactic and semantic variation go hand in hand.