The notion of measurement plays a central role in human cognition. We measure people’s height, the weight of physical objects, the length of stretches of time, or the size of various collections of individuals. Measurements of height, weight, and the like are commonly thought of as mappings between objects and dense scales, while measurements of collections of individuals, as implemented for instance in counting, are assumed to involve discrete scales. It is also commonly assumed that natural language makes use of (...) both types of scales and subsequently distinguishes between two types of measurements. This paper argues against the latter assumption. It argues that natural language semantics treats all measurements uniformly as mappings from objects (individuals or collections of individuals) to dense scales, hence the Universal Density of Measurement (UDM). If the arguments are successful, there are a variety of consequences for semantics and pragmatics, and more generally for the place of the linguistic system within an overall architecture of cognition. (shrink)

We investigate the interactions between scalar implicatures and presuppositions in sentences containing both a scalar item and presupposition trigger. We first critically discuss Gajewski and Sharvit’s previous approach. We then closely examine two ways of integrating an exhaustivity-based theory of scalar implicatures with a trivalent approach to presuppositions. The empirical side of our discussion focuses on two novel observations: the interactions between prosody and monotonicity, and what we call presupposed ignorance. In order to account for these observations, our final proposal (...) relies on two mechanisms of scalar strengthening, the Presupposed Ignorance Principle and an exhaustivity operator which lets the presuppositions of negated alternatives project. (shrink)

The existence of “local implicatures” has been the topic of much recent debate. The purpose of this paper is to contribute to this debate by asking what we can learn from three puzzles, namely, the cancellation of such implicatures by or both, their behavior in the complement clauses of negative factive verbs such as sorry, and their behavior in root and embedded questions. Two basic approaches to local implicatures have been advanced: a fully pragmatic account in which local implicatures result (...) from conventional Gricean principles and a semantic account according to which the generation of implicatures is interwoven with compositional, grammatical mechanisms. We argue that the lesson to be learned from our three case studies is that some kind of approach along the latter, grammatical line is necessary to account for the data. (shrink)

One of the central topics in semantic theory over the last few decades concerns the nature of local contexts. Recently, theorists have tried to develop general, non-stipulative accounts of local contexts (Schlenker, 2009; Ingason, 2016; Mandelkern & Romoli, 2017a). In this paper, we contribute to this literature by drawing attention to the local contexts of subclausal expressions. More specifically, we focus on the local contexts of quantificational determiners, e.g. `all', `both', etc. Our central tool for probing the local contexts of (...) subclausal elements is the principle Maximize Presupposition! (Percus, 2006; Singh, 2011). The empirical basis of our investigation concerns some data discussed by Anvari (2018b), e.g. the fact that sentences such as `All of the two presidential candidates are crooked' are unacceptable. In order to explain this, we suggest that the local context of determiners needs to contain the information carried by their restrictor. However, no existing non-stipulative account predicts this. Consequently, we think that the local contexts of subclausal expressions will likely have to be stipulated. This result has important consequences for debates in semantics and pragmatics, e.g. those around the so-called "explanatory problem" for dynamic semantics (Soames, 1982; Heim, 1990; Schlenker, 2009). (shrink)

Hypersequents are a natural generalization of ordinary sequents which turn out to be a very suitable tool for presenting cut-free Gentzent-type formulations for diverse logics. In this paper, an alternative way of formulating hypersequent calculi (by introducing meta-variables for formulas, sequents and hypersequents in the object language) is presented. A suitable category of hypersequent calculi with their morphisms is defined and both types of fibring (constrained and unconstrained) are introduced. The introduced morphisms induce a novel notion of translation between logics (...) which preserves metaproperties in a strong sense. Finally, some preservation features are explored. (shrink)