In this paper I focus on a recently discussed phenomenon illustrated by sentences containing predicates of taste: the phenomenon of " perspectival plurality " , whereby sentences containing two or more predicates of taste have readings according to which each predicate pertains to a different perspective. This phenomenon has been shown to be problematic for (at least certain versions of) relativism. My main aim is to further the discussion by showing that the phenomenon extends to other perspectival expressions than predicates (...) of taste and by proposing a general solution to the problem raised by it on behalf of the relativist. The core claim of the solution (" multiple indexing ") is that utterances of sentences containing perspectival expressions should be evaluated with respect to (possibly infinite) sequences of perspective parameters. (shrink)

This paper develops a detailed and unified analysis of semantics of the from-N-to-N construction, based on a small number of ingredients, none of which are specific to this construction itself, but which are idiomatically packaged in this construction. Letting the construction uniformly apply to the product of the two nouns not only captures their strong relation, but it also obviates a role for a ‘reduplicative’ mechanism of some sort in this particular construction.

The notion of anaphoric conservativity, that is a property of specific functions taking sets and binary relations as arguments is studied. Such functions are denotations of anaphoric determiners forming nominal anaphors. It is shown that anaphoric conservativity is strictly stronger that ordinary conservativity of this type of functions. In consequence some novel semantic descriptions of reflexive and reciprocal pronouns are provided and a semantic universal stating that reflexive and reciprocal non-possessive determiners denote anaphorically conservative functions is proposed.

The Strongest Meaning Hypothesis of Dalrymple et al (1994,1998), which was originally proposed as a principle for the interpretation of reciprocals, is extended in this paper into a general principle of plural predication. This principle applies to complex predicates that are composed of lexical predicates that hold of atomic entities, and determines the pluralities in the extension of the predicate. The meaning of such a complex predicate is claimed to be the truth-conditionally strongest meaning that does not contradict lexical properties (...) of the simple predicates it contains. Weak interpretations of reciprocals (as in the books are stacked on top of each other), plural predicate conjunction (e.g. the books are old and new) and ’atomic’ distributivity in general are derived by a unified mechanism, which ’weakens’ the basic universal meanings of strong reciprocals, boolean conjunction and quantification over atomic entities. (shrink)

This note explains the circumstances under which a type 1 quantifier can be decomposed into a type 1, 1 quantifier and a set, by fixing the first argument of the former to the latter. The motivation comes from the semantics of Noun Phrases (also called Determiner Phrases) in natural languages, but in this article, I focus on the logical facts. However, my examples are taken among quantifiers appearing in natural languages, and at the end, I sketch two more principled linguistic (...) applications. (shrink)

Clause-embedding predicates come in three major varieties: responsive predicates are compatible with both declarative and interrogative complements; rogative predicates are only compatible with interrogative complements; and anti-rogative predicates are only compatible with declarative complements. It has been suggested that these selectional properties are at least partly semantic in nature. In particular, it has been proposed that the anti-rogativity of neg-raising predicates like believe comes from the triviality in meaning that would arise with interrogative complements. This paper puts forward a similar (...) semantic explanation for non-veridical preferential predicates such as hope, which are anti-rogative, unlike their veridical counterparts such as be happy, which are responsive. (shrink)

While monadic second-order logic (MSO) has played a prominent role in model theoretic syntax, modal logics have been used in this context since its inception. When comparing propositional dynamic logic (PDL) to MSO over trees, Kracht (1997) noted that there are tree languages that can be defined in MSO that can only be defined in PDL by adding new features whose distribution is predictable. He named such features “inessential features”. We show that Kracht’s observation can be extended to other modal (...) logics of trees in two ways. First, we demonstrate that for each stronger logic, there exists a tree language that can only be defined in a weaker logic with inessential features. Second, we show that any tree language that can be defined in a stronger logic, but not in some weaker logic, can be defined with inessential features. Additionally, we consider Kracht’s definition of inessential features more closely. It turns out that there are features whose distribution can be predicted, but who fail to be inessential in Kracht’s sense. We will look at ways to modify his definition. (shrink)

We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to investigate semantic (...) distinctions between quantified reciprocal sentences. We show a computational dichotomy<br>between different readings of reciprocity. Finally, we go more into philosophical speculation on meaning, ambiguity and computational complexity. In particular, we investigate a possibility to<br>revise the Strong Meaning Hypothesis with complexity aspects to better account for meaning shifts in the domain of multi-quantifier sentences. The paper not only contributes to the field of the formal<br>semantics but also illustrates how the tools of computational complexity theory might be successfully used in linguistics and philosophy with an eye towards cognitive science. (shrink)

Hurford’s Constraint (Hurford, Foundations of Language, 11, 409–411, 1974) states that a disjunction is infelicitous if its disjuncts stand in an entailment relation: #John was born in Paris or in France. Gazdar (Pragmatics, Academic Press, NY, 1979) observed that scalar implicatures can obviate the constraint. For instance, sentences of the form (A or B) or (Both Aand B) are felicitous due to the exclusivity implicature of the first disjunct: A or B implicates ‘not (A and B)’. Chierchia, Fox, and Spector (...) (Handbook of semantics, 2008) use the obviation of Hurford’s Constraint in these cases to argue for a theory of local implicature. I present evidence indicating that the constraint needs to be modified in two ways. First, implicatures can obviate Hurford’s Constraint only in earlier disjuncts, not later ones: #(Both A and B) or (A or B). Second, the constraint rules out not only disjuncts that stand in an entailment relation, but also disjuncts that are even mutually consistent: #John is from Russia or Asia. I propose to make sense of these facts by providing an incremental evaluation procedure which checks that each new disjunct to the right is inconsistent with the information to its left, before the disjunct can be strengthened by local implicature. (shrink)

We present evidence that preschool children oftentimes understand disjunctive sentences as if they were conjunctive. The result holds for matrix disjunctions as well as disjunctions embedded under every. At the same time, there is evidence in the literature that children understand or as inclusive disjunction in downward-entailing contexts. We propose to explain this seemingly conflicting pattern of results by assuming that the child knows the inclusive disjunction semantics of or, and that the conjunctive inference is a scalar implicature. We make (...) two assumptions about implicature computation in the child: that children access only a proper subset of the adult alternatives, and that children possess the adult capacity to strengthen sentences with implicatures. As a consequence, children are expected to sometimes not compute any implicatures at all, but in other cases they are expected to compute an implicature that is different from the adult implicature. We argue that the child’s conjunctive strengthening of disjunctive sentences realizes the latter possibility: the adult infers that the conjunction is false but the child infers that the conjunction is true. This behaviour is predicted when our assumptions about child development are coupled with the assumption that a covert exhaustive operator is responsible for strengthening in both the child and the adult. Specifically, children’s conjunctive strengthening is predicted to follow from the same mechanism used by adults to compute conjunctive free choice implicatures in response to disjunctive permission sentences. We furthermore argue that this parallel between the child and the adult extends to disambiguation preferences. In particular, we present evidence that children prefer to strengthen disjunctions to conjunctions, in matrix and embedded positions ; this result mirrors previous findings that adults prefer to compute free choice, at the root and under every. We propose a disambiguation strategy that explains the preference for conjunctive strengthening – by both the child and the adult – even though there is no general preference for exhaustification. Specifically, we propose that the preference for a conjunctive strengthening follows from a pragmatic preference for a complete answer to the Question Under Discussion. (shrink)

The computation of scalar implicatures is sometimes costly relative to basic meanings. Among the costly computations are those that involve strengthening `some' to `not all' and strengthening inclusive disjunction to exclusive disjunction. The opposite is true for some other cases of strengthening, where the strengthened meaning is less costly than its corresponding basic meaning. These include conjunctive strengthenings of disjunctive sentences (e.g., free-choice inferences) and exactly-readings of numerals. Assuming that these are indeed all instances of strengthening via implicature/exhaustification, the puzzle (...) is to explain why strengthening sometimes increases costs while at other times it decreases costs. I develop a theory of processing costs that makes no reference to the strengthening mechanism or to other aspects of the derivation of the sentence's form/meaning. Instead, costs are determined by domain-general considerations of the grammar's output, and in particular by aspects of the meanings of ambiguous sentences and particular ways they update the context. Specifically, I propose that when the hearer has to disambiguate between a sentence's basic and strengthened meaning, the processing cost of any particular choice is a function of (i) a measure of the semantic complexity of the chosen meaning and (ii) a measure of how much relevant uncertainty it leaves behind in the context. I measure semantic complexity with Boolean Complexity in the propositional case and with semantic automata in the quantificational case, both of which give a domain-general measure of the minimal representational complexity needed to express the given meaning. I measure relevant uncertainty with the information-theoretic notion of entropy; this domain-general measure formalizes how `far' the meaning is from giving a complete answer to the question under discussion, and hence gives an indication of how much representational complexity is yet to come. Processing costs thus follow from domain-general considerations of current and anticipated representational complexity. The results might also speak to functional motivations for having strengthening mechanisms in the first place. Specifically, exhaustification allows language users to use simpler forms than would be available without it to both resolve relevant uncertainties and convey complex meanings. (shrink)

We report two experiments which tested whether cognitive capacities are limited to those functions that are computationally tractable (PTIME-Cognition Hypothesis). In particular, we investigated the semantic processing of reciprocal sentences with generalized quantifiers, i.e., sentences of the form Q dots are directly connected to each other, where Q stands for a generalized quantifier, e.g. all or most. Sentences of this type are notoriously ambiguous and it has been claimed in the semantic literature that the logically strongest reading is preferred (Strongest (...) Meaning Hypothesis). Depending on the quantifier, the verification of their strongest interpretations is computationally intractable whereas the verification of the weaker readings is tractable. We conducted a picture completion experiment and a picture verification experiment to investigate whether comprehenders shift from an intractable reading to a tractable reading which should be dispreferred according to the Strongest Meaning Hypothesis. The results from the picture completion experiment suggest that intractable readings occur in language comprehension. Their verification, however, rapidly exceeds cognitive capacities in case the verification problem cannot be solved using simple heuristics. In particular, we argue that during verification, guessing strategies are used to reduce computational complexity. (shrink)

We argue that a comprehensive theory of reciprocals must rely on a general taxonomy of restrictions on the interpretation of relational expressions. Developing such a taxonomy, we propose a new principle for interpreting reciprocals that relies on the interpretation of the relation in their scope. This principle, the Maximal Interpretation Hypothesis (MIH), analyzes reciprocals as partial polyadic quantifiers. According to the MIH, the partial quantifier denoted by a reciprocal requires the relational expression REL in its scope to denote a maximal (...) relation in REL’s interpretation domain. In this way the MIH avoids a priori assumptions on the available readings of reciprocal expressions, which are necessary in previous accounts. Relying extensively on the work of Dalrymple et al. (Ling Philos 21:159–210, 1998), we show that the MIH also exhibits some observational improvements over Dalrymple et al.’s Strongest Meaning Hypothesis (SMH). In addition to deriving some attested reciprocal interpretations that are not expected by the SMH, the MIH offers a more restrictive account of the way context affects the interpretation of reciprocals through its influence on relational domains. Further, the MIH generates a reciprocal interpretation at the predicate level, which is argued to be advantageous to Dalrymple et al.’s propositional selection of reciprocal meanings. More generally, we argue that by focusing on restrictions on relational domains, the MIH opens the way for a more systematic study of the ways in which lexical meaning, world knowledge and contextual information interact with the interpretation of quantificational expressions. (shrink)

Modals in St’át’imcets (Lillooet Salish) show two differences from their counterparts in English. First, they have variable quantificational force, systematically allowing both possibility and necessity interpretations; and second, they lexically restrict the conversational background, distinguishing for example between deontic and (several kinds of) epistemic modality. We provide an analysis of the St’át’imcets modals according to which they are akin to specific indefinites in the nominal domain. They introduce choice function variables which select a subset of the accessible worlds. Following Klinedinst, (...) we assume distributivity over the resulting set of worlds. St’át’imcets modals thus receive a uniform interpretation as (distributive) pluralities. The appearance of variability in modal force arises because the choice function can select a larger or smaller subset of accessible worlds. Finally, we discuss the implications of our analysis for the investigation of modal systems in other languages. (shrink)

Natural language sentences that talk about two or more sets of entities can be assigned various readings. The ones in which the sets are independent of one another are particularly challenging from the formal point of view. In this paper we will call them ‘Independent Set (IS) readings’. Cumulative and collective readings are paradigmatic examples of IS readings. Most approaches aiming at representing the meaning of IS readings implement some kind of maximality conditions on the witness sets involved. Two kinds (...) of maximization have been proposed in the literature: ‘Local’ and ‘Global’ maximization. In this paper, we present an online questionnaire whose results appear to support Local maximization. The latter seems to capture the proper interplay between the semantics and the pragmatics of multi-quantifier sentences, provided that witness sets are selected on pragmatic grounds. (shrink)

This article proposes a new logical framework for NL quantification. The framework is based on Generalized Quantifiers, Skolem-like functional dependencies, and Maximality of the involved sets of entities. Among the readings available for NL sentences, those where two or more sets of entities are independent of one another are particularly challenging. In the literature, examples of those readings are known as Collective and Cumulative readings. This article briefly analyzes previous approaches to Cumulativity and Collectivity, and indicates (Schwarzschild in Pluralities. Kluwer, (...) Dordrecht, 1996) as the best proposal so far to deal with these readings. Then, it incorporates its insights in the logical framework defined in Robaldo (J Philos Log 39(1):23–58, 2009a), leading to a scalable logical account for NL quantification. (shrink)

This paper investigates how the distribution of negative polarity items can inform our understanding of the underlying semantic representation of constituent questions. It argues that the distribution of NPIs in questions is governed by the same logical properties that govern their distribution in declarative constructions. Building on an observation due to Guerzoni and Sharvit that strength of exhaustivity in questions correlates with the acceptability of NPIs, I propose a revision of the semantics of questions that can explain this link in (...) terms already familiar from the literature of negative polarity, namely the availability of a local downward entailing environment. I argue for a new theory of questions that takes strength of exhaustivity to be encoded internal to the question nucleus rather than in different answer-hood operators. This switch, while conceptually a simple move, has far-reaching consequences in the domain of questions. I also show how this new analysis can account for a host of issues related to NPIs, such as the subject–object asymmetry noted by Han and Siegel, the interaction between NPIs and high versus low wh-adjuncts, the varying acceptability of NPIs in the restrictor of which-phrases, and the contrast between weak and strong NPIs. (shrink)

Categorial grammar is well-known for its elegant analysis of coordination enabled by the flexible notion of constituency it entertains. However, to date, no systematic study exists that examines whether this analysis has any obvious empirical advantage over alternative analyses of nonconstituent coordination available in phrase structure-based theories of syntax. This paper attempts precisely such a comparison. We compare the direct constituent coordination analysis of non-canonical coordinations in categorial grammar with an ellipsis-based analysis of the same phenomena in the recent HPSG (...) literature. We provide a set of empirical evidence, consisting of cases in which non-canonical coordinations interact with scopal operators of various sorts, which systematically falsifies the predictions of the latter, ‘linearization-based’ ellipsis approach to coordination. We propose an alternative analysis in a variant of categorial grammar called Hybrid Type-Logical Categorial Grammar. The proposed framework builds on both the Lambek-inspired variants of categorial grammar and a more recent line of work modelling word order via a lambda calculus for the prosodic component. The flexible syntax–semantics interface of this framework straightforwardly captures the interactions between non-canonical coordinations and scopal expressions, demonstrating the broader empirical payoff of the direct constituent coordination analysis of non-canonical coordinations pioneered by Steedman :523–568, 1985; Linguist Philos 13:207–263, 1990) and Dowty hitherto not explicitly recognized in the literature. (shrink)

Plural definite descriptions across many languages display two well-known properties. First, they can give rise to so-called non-maximal readings, in the sense that they ‘allow for exceptions’. Second, while they tend to have a quasi-universal quantificational force in affirmative sentences, they tend to be interpreted existentially in the scope of negation. Building on previous works, we offer a theory in which sentences containing plural definite expressions trigger a family of possible interpretations, and where general principles of language use account for (...) their interpretation in various contexts and syntactic environments. Our theory solves a number of problems that these previous works encounter, and has broader empirical coverage in that it offers a precise analysis for sentences that display complex interactions between plural definites, quantifiers and bound variables, as well as for cases involving non-distributive predicates. The resulting proposal is briefly compared with an alternative proposal by Križ, which has similar coverage but is based on a very different architecture and sometimes makes subtly different predictions. (shrink)

This paper investigates the way that linguistic expressions influence vagueness, focusing on the interpretation of the positive (unmarked) form of gradable adjectives. I begin by developing a semantic analysis of the positive form of ‘relative’ gradable adjectives, expanding on previous proposals by further motivating a semantic basis for vagueness and by precisely identifying and characterizing the division of labor between the compositional and contextual aspects of its interpretation. I then introduce a challenge to the analysis from the class of ‘absolute’ (...) gradable adjectives: adjectives that are demonstrably gradable, but which have positive forms that relate objects to maximal or minimal degrees, and do not give rise to vagueness. I argue that the truth conditional difference between relative and absolute adjectives in the positive form stems from the interaction of lexical semantic properties of gradable adjectives—the structure of the scales they use—and a general constraint on interpretive economy that requires truth conditions to be computed on the basis of conventional meaning to the extent possible, allowing for context dependent truth conditions only as a last resort. (shrink)

Quantifiers in Language and Logic (QLL) is a major contribution to natural language semantics, specifically to quantification. It integrates the extensive recent work on quantifiers in logic and linguistics. It also presents new observations and results. QLL should help linguists understand the mathematical generalizations we can make about natural language quantification, and it should interest logicians by presenting an extensive array of quantifiers that lie beyond the pale of classical logic. Here we focus on those aspects of QLL we judge (...) to be of specific interest to linguists, and we contribute a few musings of our own, as one mark of a worthy publication is whether it stimulates the reader to seek out new observations, and QLL does. QLL is long and fairly dense, so we make no attempt to cover all the points it makes. But QLL has a topic index, a special symbols index and two tables of contents, a detailed one and an overview one, all of which help make it user friendly. QLL is presented in four parts: I, The Logical Conception of Quantifiers and Quantification with an introductory section Quantification . II, Quantifiers of Natural Language , the most extensive section in the book and of the most direct interest to linguists. III, Beginnings of a Theory of Expressiveness, Translation, and Formalization introduces notions of expressive power and definability, and IV, presents recent work and techniques concerning quantifier definability over finite domains, making accessible to linguists recent work in finite model theory. (shrink)

Quantifiers in Language and Logic (QLL) is a major contribution to natural language semantics, specifically to quantification. It integrates the extensive recent work on quantifiers in logic and linguistics. It also presents new observations and results. QLL should help linguists understand the mathematical generalizations we can make about natural language quantification, and it should interest logicians by presenting an extensive array of quantifiers that lie beyond the pale of classical logic. Here we focus on those aspects of QLL we judge (...) to be of specific interest to linguists, and we contribute a few musings of our own, as one mark of a worthy publication is whether it stimulates the reader to seek out new observations, and QLL does. QLL is long and fairly dense, so we make no attempt to cover all the points it makes. But QLL has a topic index, a special symbols index and two tables of contents, a detailed one and an overview one, all of which help make it user friendly. QLL is presented in four parts: I, "The Logical Conception of Quantifiers and Quantification" with an introductory section "Quantification". II, "Quantifiers of Natural Language", the most extensive section in the book and of the most direct interest to linguists. III, "Beginnings of a Theory of Expressiveness, Translation, and Formalization" introduces notions of expressive power and definability, and IV, presents recent work and techniques concerning quantifier definability over finite domains, making accessible to linguists recent work in finite model theory. (shrink)

In this paper, we study natural language constructions which were first examined by Barwise: The richer the country, the more powerful some of its officials. Guided by Barwise’s observations, we suggest that conceivable interpretations of such constructions express the existence of various similarities between partial orders such as homomorphism or embedding. Semantically, we interpret the constructions as polyadic generalized quantifiers restricted to finite models. We extend the results obtained by Barwise by showing that similarity quantifiers are not expressible in elementary (...) logic over finite models. We also investigate whether the proposed readings are sound from the cognitive perspective. We prove that almost all similarity quantifiers are intractable. This leads us to first-order variants, which only approximate the strong readings, but are cognitively more plausible. Driven by the question of ambiguity, we recall Barwise’s argumentation in favour of strong readings, enriching it with some arguments of our own. Given that Barwise-like sentences are indeed ambiguous, we use a generalized Strong Meaning Hypothesis to derive predictions for their verification. Finally, we propose a hypothesis according to which conflicting pressures of communication and cognition might give rise to an ambiguous construction, provided that different semantic variants of the construction withstand different pressures involved in its usage. (shrink)

Ontology is the philosophical discipline that tries to find out what there is: what entities make up reality, what is the stuff the world is made from? Thus, ontology is part of metaphysics, and in fact it seems to be about half of all of metaphysics. It tries to establish what (kinds of) things there are, the other half tries to find out what the (general) properties of these things are and what (general) relations they have to each other. Settling (...) questions in ontology would bring with it major progress in metaphysics. And it would bring with it major progress in a variety of areas in philosophy outside of metaphysics as well. Many philosophical debates outside of metaphysics are quite directly influenced by how things turn out in ontology. Whether or not there are certain entities will give rise to quite different answers in various philosophical debates. I would like to very briefly describe three debates where ontological questions play a central role. These debates are either directly from metaphysics or from other areas of philosophy and they will be of central importance throughout this paper. (shrink)

Sentences like _Mary needs to make the fewest mistakes on the upcoming test_ have a ‘split scope’ reading roughly paraphrasable as ‘Mary exceeds all others in terms of how many mistakes she must _not_ make’; that is, her situation is the most precarious. The structural approach to this phenomenon attributes to such sentences a logical form resembling this paraphrase, in which the superlative component of the meaning of _fewest_ scopes above the modal _need to_ and the negative component scopes below (...) it. This paper investigates analogous structures in Syrian Arabic, a language in which superlatives may appear at a distance from their scalar associates in the surface order. The syntax of such expressions in Syrian Arabic, and the range of interpretations available to the various syntactic permutations found there points to two different sources for split scope readings. While some split scope readings are derived by syntactic splitting of _fewest_ across a modal verb, others arise from a semantic ambiguity in the modal verb itself, rather than from a syntactic distinction in logical form. (shrink)

This paper explores the relationship between dynamic and truth conditional semantics for epistemic modals. It provides a generalization of a standard dynamic update semantics for modals. This new semantics derives a Kripke semantics for modals and a standard dynamic semantics for modals as special cases. The semantics allows for new characterizations of a variety of principles in modal logic, including the inconsistency of ‘p and might not p’. Finally, the semantics provides a construction procedure for transforming any truth conditional semantics (...) for modals into a dynamic semantics for modals with similar properties. (shrink)

Next SectionWe discuss the thesis formulated by Hintikka (1973) that certain natural language sentences require non-linear quantification to express their meaning. We investigate sentences with combinations of quantifiers similar to Hintikka's examples and propose a novel alternative reading expressible by linear formulae. This interpretation is based on linguistic and logical observations. We report on our experiments showing that people tend to interpret sentences similar to Hintikka sentence in a way consistent with our interpretation.

Building on previous works which argued that scalar implicatures can be computed in embedded positions, this paper proposes a constraint on exhaustification which restricts the conditions under which an exhaustivity operator can be licensed. We show that this economy condition allows us to derive a number of generalizations, such as, in particular, the ‘Implicature Focus Generalization’: scalar implicatures can be embedded under a downward-entailing operator only if the scalar term bears pitch accent. Our economy condition also derives specific predictions regarding (...) the licensing of so-called Hurford disjunctions. (shrink)

We present two eye-tracking experiments on the interpretation of sentences like “The tall girl is the only one that …,” which are ambiguous between the anaphoric and the exophoric interpretation. These interpretations differ in informativeness: in a positive context, the exophoric reading entails the anaphoric, while in a negative context the entailment pattern is reversed and the anaphoric reading is the strongest one. We tested whether adults rely on considerations about informativeness in solving the ambiguity. The results show that participants (...) interpreted one exophorically in both positive and negative contexts. Given these findings, we cast doubts on the idea that Informativeness plays a role in ambiguity resolution and proposes a Principle of Maximal Exploitation: When a context is provided, adults extend their domain of evaluation to include the whole scenario, independently from truth-conditional considerations about informativity and strength. (shrink)

In this paper we examine interactions of the reciprocal with distributive and collective operators, which are encoded by prefixes on verbs expressing the reciprocal relation: namely, the Czech distributive po and the collectivizing na-. The theoretical import of this study is two-fold. First, it contributes to our knowledge of how word-internal operators interact with phrasal syntax/semantics. Second, the prefixes po and na generate (a range of) readings of reciprocal sentences for which the Strongest Meaning Hypothesis (SMH) proposed by Dalrymple et (...) al. (1998) does not make the right predictions. The distributive prefix po prefers the Strong Reciprocity reading, although the SMH predicts that a weakening should take place, while with the prefix na we find cases where weaker reciprocal readings are preferable to the stronger ones predicted by the SMH. This behavior of po and na is, we propose, due to the way in which they modulate two factors that are crucial in the interpretation of reciprocal sentences: (i) the relevant subpluralities in the group denoted by the reciprocal's antecedent, and (ii) the strength of reciprocal relations. We provide a detailed analysis of the semantics of the prefixes po and na and their contribution to the meaning of reciprocal sentences within the general framework of event semantics with lattice structures. (shrink)

Quantifiers in phrasal and clausal comparatives often seem to take distributive scope in the matrix clause: for instance, the sentence John is taller than every girl is is true iff for every girl it holds that John is taller than that girl. Broadly speaking, two approaches exist that derive this reading without postulating the wide scope of the quantifier: the negation analysis and the interval analysis of than-clauses. We propose a modification of the interval analysis in which than-clauses are not (...) treated as degree intervals but as degree pluralities. This small change has significant consequences: it yields a straightforward account of differentials in comparatives and it correctly predicts the existence of hitherto unnoticed readings, viz. cumulative readings of clausal comparatives. Finally, this paper also makes the case that using degree pluralities is conceptually appealing: it allows us to restrict the analysis of comparatives by mechanisms that are postulated independently in the semantics of pluralities. (shrink)

In a previous paper (see ‘Tolerant, Classical, Strict’, henceforth TCS) we investigated a semantic framework to deal with the idea that vague predicates are tolerant, namely that small changes do not affect the applicability of a vague predicate even if large changes do. Our approach there rests on two main ideas. First, given a classical extension of a predicate, we can define a strict and a tolerant extension depending on an indifference relation associated to that predicate. Second, we can use (...) these notions of satisfaction to define mixed consequence relations that capture non-transitive tolerant reasoning. Although we gave some empirical motivation for the use of strict and tolerant extensions, making use of them commits us to the view that sentences of the form ‘ p∨¬p ’ and ‘ p∧¬p ’ are not automatically valid or unsatisfiable, respectively. Some philosophers might take this commitment as a negative outcome of our previous proposal. We think, however, that the general ideas underlying our previous approach to vagueness can be implemented in a variety of ways. This paper explores the possibility of defining mixed notions of consequence in the more classical super/sub-valuationist setting and examines to what extent any of these notions captures non-transitive tolerant reasoning. (shrink)

In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classical notion, and two dual notions simultaneously defined in terms of it, (...) which we call tolerant truth and strict truth. We characterize the space of consequence relations definable in terms of those and discuss the kind of solution this gives to the sorites paradox. We discuss some applications of the framework to the pragmatics and psycholinguistics of vague predicates, in particular regarding judgments about borderline cases. (shrink)

A number of natural language constructions seem to provide access to structured pluralities — that is, pluralities of pluralities. A body of semantic work has debated how to model this additional structure and the extent to which it depends on pragmatics. In this article, after controlling for the distinction between ambiguity and underspecification, we present new data showing that structured pluralities are sometimes but not always available, depending on the form of the plural noun phrase used. We show that these (...) results challenge two longstanding theories of plurality. We sketch two different ways to account for these data and describe some of the diverging predictions they make. (shrink)

The paper argues that two distinct and independent notions of plurality are involved in natural language anaphora and quantification: plural reference (the usual non-atomic individuals) and plural discourse reference, i.e., reference to a quantificational dependency between sets of objects (e.g., atomic/non-atomic individuals) that is established and subsequently elaborated upon in discourse. Following van den Berg (PhD dissertation, University of Amsterdam, 1996), plural discourse reference is modeled as plural information states (i.e., as sets of variable assignments) in a new dynamic system (...) couched in classical type logic that extends Compositional DRT (Muskens, Linguistics and Philosophy, 19, 143-186, 1996). Given the underlying type logic, compositionality at sub-clausal level follows automatically and standard techniques from Montague semantics become available. The idea that plural info states are semantically necessary (in addition to non-atomic individuals) is motivated by relative-clause donkey sentences with multiple instances of singular donkey anaphora that have mixed (weak and strong) readings. At the same time, allowing for non-atomic individuals in addition to plural info states enables us to capture the intuitive parallels between singular and plural (donkey) anaphora, while deriving the incompatibility between singular (donkey) anaphora and collective predicates. The system also accounts for empirically unrelated phenomena, e.g., the uniqueness effects associated with singular (donkey) anaphora discussed in Kadmon (Linguistics and Philosophy, 13, 273-324, 1990) and Heim (Linguistics and Philosophy, 13, 131-177, 1990) among others. (shrink)

The term “vagueness” describes a property of natural concepts, which normally have fuzzy boundaries, admit borderline cases, and are susceptible to Zeno's sorites paradox. We will discuss the psychology of vagueness, especially experiments investigating the judgment of borderline cases and contradictions. In the theoretical part, we will propose a probabilistic model that describes the quantitative characteristics of the experimental finding and extends Alxatib's and Pelletier's () theoretical analysis. The model is based on a Hopfield network for predicting truth values. Powerful (...) as this classical perspective is, we show that it falls short of providing an adequate coverage of the relevant empirical results. In the final part, we will argue that a substantial modification of the analysis put forward by Alxatib and Pelletier and its probabilistic pendant is needed. The proposed modification replaces the standard notion of probabilities by quantum probabilities. The crucial phenomenon of borderline contradictions can be explained then as a quantum interference phenomenon. (shrink)

This article studies the monotonicity behavior of plural determinersthat quantify over collections. Following previous work, we describe thecollective interpretation of determiners such as all, some andmost using generalized quantifiers of a higher type that areobtained systematically by applying a type shifting operator to thestandard meanings of determiners in Generalized Quantifier Theory. Twoprocesses of counting and existential quantification thatappear with plural quantifiers are unified into a single determinerfitting operator, which, unlike previous proposals, both capturesexistential quantification with plural determiners and respects theirmonotonicity (...) properties. However, some previously unnoticed factsindicate that monotonicity of plural determiners is not always preservedwhen they apply to collective predicates. We show that the proposedoperator describes this behavior correctly, and characterize themonotonicity of the collective determiners it derives. It is proved thatdeterminer fitting always preserves monotonicity properties ofdeterminers in their second argument, but monotonicity in the firstargument of a determiner is preserved if and only if it is monotonic inthe same direction in the second argument. We argue that this asymmetryfollows from the conservativity of generalized quantifiers innatural language. (shrink)

This paper proposes that elementary reciprocal sentences have four semantic readings: a strongly reciprocal interpretation, a weakly reciprocal interpretation, a situation-based weakly reciprocal reading, and a collective reading. Interpretational possibilities of reciprocal sentences that have been discussed in the literature are identified as one of these four. A compositional semantic analysis of all of these readings is provided in which the reciprocal expression is uniformly represented as 'the other ones among them' (recasting Heim, Lasnik and May 1991a, b). A reciprocal (...) sentence is thus a special kind of relational plural. Interpretational variability comes about by the same mechanisms of plural predication at work in relational plurals: pluralization operators, LF operations like QR, and addition of contextual information. (shrink)

Winter (2000) argues that so-called co-distributive or cumulative readings do not involve polyadic quantification (contra proposals by Krifka, Schwarzschild, Sternefeld, and others). Instead, he proposes that all such readings involve a hidden anaphoric dependency or a lexical mechanism. We show that Winter's proposal is insufficient for a number of cases of cumulative readings, and that Krifka's and Sternefeld's polyadic **-operator is needed in addition to dependent definites. Our arguments come from new observations concerning dependent plurals and clause-boundedness effects with cumulative (...) readings. (shrink)

Naive speakers find some logical contradictions acceptable, specifically borderline contradictions involving vague predicates such as Joe is and isn’t tall. In a recent paper, Cobreros et al. (J Philos Logic, 2012) suggest a pragmatic account of the acceptability of borderline contradictions. We show, however, that the pragmatic account predicts the wrong truth conditions for some examples with disjunction. As a remedy, we propose a semantic analysis instead. The analysis is close to a variant of fuzzy logic, but conjunction and disjunction (...) are interpreted as intensional operators. (shrink)

It is well known that the interpretation of quantificational expressions in the comparative clause poses a serious challenge for semantic analyses of the English comparative. In this paper, we develop a new analysis of the comparative clause designed to meet this challenge, in which a silent occurrence of the negative degree quantifier no interacts with other quantificational expressions to derive the observed range of interpretations. Although our analysis incorporates ideas from previous analyses, we show that it is able to account (...) for a broader range of facts than other approaches, with a minimum of construction-specific stipulations. We demonstrate that the analysis can be embedded within a general syntactic and semantic architecture for the comparative, and although our analysis focuses on the English data, we give evidence of its potential for crosslinguistic application. We conclude with a discussion of the implications of our approach for the analysis of “split-scope” phenomena in nominal quantification. (shrink)

In this book an introduction to the grammatical view of the scalar implicature phenomenon is presented. A detailed overview is offered concerning the embeddability of the exhaustivity operator, and the contextual dependance of the alternatives generation process. The theoretical implications of the grammatical view with respect to the abductive character of the scalar implicature are also discussed. A pragmatic account of the assertive content is proposed in correlation with a blindness-based account of the semantic content carried by scalar sentences, in (...) order to ensure that the information globally conveyed by the latter is sometimes different from the semantic content automatically generated. -/- . (shrink)