Using the programming-language concept of continuations, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of in-situ quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, type-logical way to model evaluation order and side effects in natural language. We illustrate with an (...) improved account of quantificational binding, weak crossover, wh-questions, superiority, and polarity licensing. (shrink)

Quantificational arguments can take scope outside of temporal adjunct clauses, in an apparent violation of locality restrictions: the sentence few secretaries cried after each executive resigned allows the quantificational NP each executive to take scope above few secretaries. I show how this scope relation is the result of local operations: the adjunct clause is a temporal generalized quantifier which takes scope over the main clause (Pratt and Francez, Linguistic and Philosophy 24(2), 187–222. [2001]), and within the adjunct clause, the quantificational (...) argument takes scope above the implicit determiner which forms the temporal generalized quantifier. The paper explores various relations among quantificational arguments across clause boundaries, including temporal clauses that are modified internally by a temporal adverbial and temporal clauses with embedded sentential complements. (shrink)

In his book Language in Context, Jason Stanley provides a novel solution to certain interpretational puzzles (Stanley, 2007). The aphonic approach, as we call it, hangs upon a substantial syntactic thesis. Here, we provide theoretical and empirical arguments against this particular syntactic thesis. Moreover, we demonstrate that the interpretational puzzles under question admit of a better solution under the explicit approach.

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the nature (...) of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

Comparative quantifiers, such as more than three books, cannot take scope over any quantifier in subject position if they occupy object position. This is clearly different from the behavior of other quantifiers (e.g., universal quantifiers). This paper argues that this scope puzzle is due to a more complex internal structure of comparative quantifiers than other quantifiers. In the decompositional approach that I pursue, comparative quantifiers are decomposed into two generalized quantifiers (i.e., in the case above, the comparative operator er than (...) three and the DP many books). In this approach, obligatory narrow scope of comparative quantifiers in object position is a consequence of the interplay of the independently motivated principles of grammar that also constrain other quantifiers. On the basis of the scope puzzle, I specifically argue for two constraints on Scope Shifting Operations (SSOs) a locality condition on SSOs and Scope Economy, proposed by Fox (2000), which prohibits SSOs that have no effect on semantic interpretation. Thus, I argue that the apparently peculiar facts of comparative quantifiers are, in fact, additional evidence for the core properties of SSOs. (shrink)

Since Fodor 1970, negation has worn a Homogeneity Condition to the effect that homogeneous predicates, ) denote homogeneously—all or nothing —to characterize the meaning of – when uttered out-of-the blue, in contrast to –:The mirrors are smooth. The mirrors are not smooth. The mirrors circle the telescope’s reflector. The mirrors do not circle the telescope’s reflector. It has been a problem for philosophical logic and for the semantics of natural language that – appear to defy the Principle of Excluded Middle (...) while – do not—Smooth ¬Smooth Circle ¬Circle. An impoverished logical form – has been the occasion to embellish all else—Boolean algebra, lexical presuppositions, Strongest Meaning Hypothesis, trivalence, supervaluation, double strengthening, etc., enriching the semantics and pragmatics with what remains a special theory of negation, which may be dismissed when the logical syntax and semantics of negation reflects that negated sentences are also tensed sentences. (shrink)

The semantic function of the modifier 'together' in adnominal position has generally been considered to be that of preventing a distributive reading of the predicate. This paper will argue that this view is mistaken. The semantic function of adnominal 'together' rather is that of inducing a cumulative measurement of the group that together is associated with. The measurement-based analysis of adnominal together that I propose can also, with some modifications, be extended to adverbial occurrences of together.

Limited distribution phenomena related to negation and negative polarity are usually thought of in terms of affectivity where affective is understood as negative or downward entailing. In this paper I propose an analysis of affective contexts as nonveridical and treat negative polarity as a manifestation of the more general phenomenon of sensitivity to (non)veridicality (which is, I argue, what affective dependencies boil down to). Empirical support for this analysis will be provided by a detailed examination of affective dependencies in Greek, (...) but the distribution of any will also be shown to follow from (non)veridicality. (shrink)

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the nature (...) of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of verification and validation ); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of proxy ) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of commutation ); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

In many languages, the same particles build quantifier words and serve as connectives, additive and scalar particles, question markers, existential verbs, and so on. Do the roles of each particle form a natural class with a stable semantics? Are the particles aided by additional elements, overt or covert, in fulfilling their varied roles? I propose a unified analysis, according to which the particles impose partial ordering requirements (glb and lub) on the interpretations of their hosts and the immediate larger contexts, (...) but do not embody algebraic operations themselves. (shrink)

In this paper, I shall explore a determiner in natural language which is ambivalent as to whether it should be classified as quantificational or objectdenoting: the determiner both. Both in many ways appears to be a paradigmatic quantifier; and yet, I shall argue, it can be interpreted as having an individual—an object—as semantic value. To show the significance of this, I shall discuss two ways of thinking about quantifiers. We often think about quantifiers via intuitions about kinds of thoughts. Certain (...) terms are naturally used to express singular thoughts, and appear to do so by contributing objects to the thoughts expressed. Other terms are naturally used to express general thoughts, and appear to do so by contributing higher-order properties to the thoughts expressed. Viewed this way, the main condition on whether a term is a quantifier or not is whether its semantic value is an object or a higher-order property. At least, these provide necessary conditions. Both can be interpreted as contributing objects to thoughts, and in many cases appears to express genuine singular thoughts. Thinking about quantifiers this way, both can appear object-denoting and non-quantificational. We also often think about quantifiers in terms of a range linguistic features, including semantic value, presupposition, scope, binding, syntactic distribution, and many others. Viewed this way, I shall argue, both can appear quantificational. In particular, it displays scope behavior that is one of the hallmarks of quantification. But, I shall show, it can do so even if given a semantics on which it denotes an object. Thus, both appears quantificational by some linguistic standards, and yet appears object-denoting by standards based on intuitions about the kinds.. (shrink)

In the Linguistics Companion, Blackwell, Oxford. Available in on-line encyclopedia.

The first part of this article (Sections 1–5) focuses on the classical notions of scope and binding and their formal foundations. It argues that once their semantic core is properly understood, it can be implemented in various different ways: with or without movement, with or without variables. The second part (Sections 6–12) takes up the empirical issues that have redrawn the map in the past two decades. It turns out that scope is not a primitive. Existential scope and distributive scope (...) have to be distinguished, leaving few if any run-of-the-mill quantifiers. Scope behavior is also not uniform. At least three classes of expressions emerge: indefinites, distributive universals, and counters. Likewise, the bound variable interpretation of pronouns is joined by co-variation with situations. As a result, the classical notions of scope and binding are likely to end up as building blocks in the varied mechanisms at work in “scope phenomena” and “binding phenomena”, and not as self-contained analyses of those phenomena. (shrink)

This paper will be concerned with the conjunctive interpretation of a family of disjunctive constructions. The relevant conjunctive interpretation, sometimes referred to as a “free choice effect,” (FC) is attested when a disjunctive sentence is embedded under an existential modal operator. I will provide evidence that the relevant generalization extends (with some caveats) to all constructions in which a disjunctive sentence appears under the scope of an existential quantifier, as well as to seemingly unrelated constructions in which conjunction appears under (...) the scope of negation and a universal quantifier. (shrink)