Linguists often sharply distinguish the different modules that support linguistics competence, e.g., syntax, semantics, pragmatics. However, recent work has identified phenomena in syntax (polarity sensitivity) and pragmatics (implicatures), which seem to rely on semantic properties (monotonicity). We propose to investigate these phenomena and their connections as a window into the modularity of our linguistic knowledge. We conducted a series of experiments to gather the relevant syntactic, semantic and pragmatic judgments within a single paradigm. The comparison between these quantitative data leads (...) us to four main results, (i) Our results support a departure from one element of the classical Gricean approach, thus helping to clarify and settle an empirical debate. This first outcome also confirms the soundness of the methodology, as the results align with standard contemporary accounts of scalar implicature (SI), (ii) We confirm that the formal semantic notion of monotonicity underlies negative polarity item (NPI) syntactic acceptability, but (iii) our results indicate that the notion needed is perceived monotonicity. We see results (ii) and (iii) as the main contribution of this study: (ii) provides an empirical interpretation and confirmation of one of the insights of the model-theoretic approach to semantics, while (iii) calls for an incremental, cognitive implementation of the current generalizations, (iv) Finally, our results do not indicate that the relationship between NPI acceptability and monotonicity is mediated by pragmatic features related to Sis: this tells against elegant attempts to unify polarity sensitivity and Sis (pioneered by Krifka and Chierchia). These results illustrate a new methodology for integrating theoretically rigorous work in formal semantics with an experimentally-grounded cognitively-oriented view of linguistic competence. (shrink)

Positive Polarity indefinites, such as some in English, are licensed in simplex negative sentences as long as they take wide scope over negation. When it surfaces under a clausemate negation, some can in principle take wide scope either by movement or by some semantic mechanism; e.g., it can take pseudoscope if it is interpreted as a choice function variable. Therefore, there is some uncertainty regarding the way in which PPI indefinites get licensed: can pseudoscope suffice? In this article we show, (...) using novel data from Hindi-Urdu and English, that pseudoscope is not sufficient, and that it is the syntactic position of PPI indefinites at LF, rather than their actual scope, which is relevant for licensing. These facts support a unified view of PPI indefinites as generalized quantifiers, and disfavor analyses where they are, or can be, interpreted as choice function variables. (shrink)

This article offers a unified theory of the licensing of Negative and Positive Polarity Items, focusing on the acceptability conditions of PPIs of the some-type, and NPIs of the any-type. It argues that licensing has both a syntactic and a semantic component. On the syntactic side, the acceptability of PIs is checked in constituents; in fact, for any given PI, only some constituents, referred to as `domains', are eligible for the evaluation of that PI. The semantic dimension of licensing consists (...) in the sensitivity of PIs to the monotonicity properties of the syntactic environments they find themselves in. Two pieces of evidence support the semantic dimension of what I call the ‘environment-based’ approach defended here: PIs are subject to flip-flop and certain inferences affect their acceptability by modifying the monotonicity of their environment. A third property, called ‘entanglement’ and so far unnoticed, is described: the acceptability of PIs depends on the acceptability of other PIs in the same syntactic environment. The latter property is exploited to determine what semantic property some is sensitive to: it turns out that, contrary to the consensus among researchers, some is acceptable in the complement of the set of environments in which any is acceptable, and vice versa. (shrink)

We examine the distribution of differentials in nominal comparatives in a range of languages and find a surprising diversity of patterns. While English allows for both numerals and numerically quantified noun phrases as differentials, many languages cannot use numerals as differentials. We show that the classical semantics of comparatives extends naturally to the nominal comparatives with numeral differentials but not to the case where the differential is a numerically quantified noun phrase. We extend the semantics to handle these cases. We (...) further show that this extension is not sufficient to handle differentials in nominal comparatives in French where a more radical extension is motivated. This close examination of differentials teaches us that the class of measure phrases is much larger than traditionally conceived, potentially coextensive with the class of count nouns. (shrink)

We develop a bounded version of the finite injury priority method in recursion theory. We use this to study the learnability of unions of rectangles over the domain {0, …, n − 1}d with only equivalence queries. Applying this method, we show three main results:1. The class of unions of rectangles is polynomial time learnable for constant dimension d.2. The class of unions of rectangles whose projections at some unknown dimension are pairwise-disjoint is polynomial time learnable.3. The class of unions (...) of two disjoint rectangles is polynomial time learnable with unions of two rectangles as hypotheses. (shrink)