A Krom formula of pure quantification theory is a formula in conjunctive normal form such that each conjunct is a disjunction of at most two atomic formulas or negations of atomic formulas. Every class of Krom formulas that is determined by the form of their quantifier prefixes and which is known to have an unsolvable decision problem for satisfiability is here shown to be a conservative reduction class. Therefore both the general satisfiability problem, and the problem of satisfiability in finite (...) models, can be effectively reduced from arbitrary formulas to Krom formulas of these several prefix types. (shrink)

This paper is devoted to the study of some subvarieties of the variety Qof Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Qis far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q 3 and we construct the lattice of subvarieties (...) (Q 3 ) of the variety Q 3. (shrink)

Partee (1973) discussed quotation from the perspective of the then relatively new theory of transformational grammar.2 As she pointed out, the phenomenon presents many curious puzzles. In some ways quotes seem quite separate from their surrounding text; they may be in a different dialect, as in her example in (1), (1) ‘I talk better English than the both of youse!’ shouted Charles, thereby convincing me that he didn’t. [Partee (1973):ex. 20] or even in a different language, as in (2): (2) (...) Louise said ‘Je voudrais un auto-da-f´e’, but I didn’t know what she meant. (shrink)

This paper sets forth a new theory of quantifiers and term connectives, called shadow theory , which should help simplify various semantic theories of natural language by greatly reducing the need of Montagovian proper names, type-shifting, and λ-conversion. According to shadow theory, conjunctive, disjunctive, and negative noun phrases such as John and Mary , John or Mary , and not both John and Mary , as well as determiner phrases such as every man , some woman , and the boys (...) , are all of semantic type e and denote individual-like objects, called shadows — conjunctive , disjunctive , or negative shadows, such as John-and-Mary, John-or-Mary, and not-(John-and-Mary). There is no essential difference between quantification and denotation: quantification is nothing but denotation of shadows. Individuals and shadows constitute a Boolean structure. Formal language LSD (Language for Shadows with Distributivity), which takes compound terms to denote shadows, is investigated. Expansions and enrichments of LSD are also considered toward the end of the paper. (shrink)

We consider a predicate logic Lfd where not all assignments of values to individual variables are possible. Some variables are functionally dependent on other variables. This makes sense if the models of logic are assumed to correspond to databases or states. We show that Lfd is undecidable but has a complete and sound sequent calculus formalisation.

In §21 of Grundgesetze der Arithmetik asks us to consider the forms: a a2 = 4 and a a > 0 and notices that they can be obtained from a φ(a) by replacing the function-name placeholder φ(ξ) by names for the functions ξ2 = 4 and ξ > 0 (and the placeholder cannot be replaced by names of objects or of functions of 2 arguments).

Henry Leonard and Karel Lambert first introduced so-called presupposition-free (or just simply: free) logics in the 1950’s in order to provide a logical framework allowing for non-denoting singular terms (be they descriptions or constants) such as “the largest prime” or “Pegasus” (see Leonard [1956] and Lambert [1960]). Of course, ever since Russell’s paradigmatic treatment of definite descriptions (Russell [1905]), philosophers have had a way to deal with such terms. A sentence such as “the..

This paper presents a formalization of first-order arithmetic characterizing the natural numbers as abstracta of the equinumerosity relation. The formalization turns on the interaction of a nonstandard (but still first-order) cardinality quantifier with an abstraction operator assigning objects to predicates. The project draws its philosophical motivation from a nonreductionist conception of logicism, a deflationary view of abstraction, and an approach to formal arithmetic that emphasizes the cardinal properties of the natural numbers over the structural ones.

We hardly ever mean exactly what we say. I don’t mean that we generally speak figuratively or that we’re generally insincere. Rather, I mean that we generally speak loosely, omitting words that could have made what we meant more explicit and letting our audience fill in the gaps. Language works far more efficiently when we do that. Literalism can have its virtues, as when we’re drawing up a contract, programming a computer, or writing a philosophy paper, but we generally opt (...) for efficiency over explicitness. In.. (shrink)

Connectionist attention to variables has been too restricted in two ways. First, it has not exploited certain ways of doing without variables in the symbolic arena. One variable-avoidance method, that of logical combinators, is particularly well established there. Secondly, the attention has been largely restricted to variables in long-term rules embodied in connection weight patterns. However, short-lived bodies of information, such as sentence interpretations or inference products, may involve quantification. Therefore short-lived activation patterns may need to achieve the effect of (...) variables. The paper is mainly a theoretical analysis of some benefits and drawbacks of using logical combinators to avoid variables in short-lived connectionist encodings without loss of expressive power. The paper also includes a brief survey of some possible methods for avoiding variables other than by using combinators. (shrink)

I here argue that Ted Sider's indeterminacy argument against vagueness in quantifiers fails. Sider claims that vagueness entails precisifications, but holds that precisifications of quantifiers cannot be coherently described: they will either deliver the wrong logical form to quantified sentences, or involve a presupposition that contradicts the claim that the quantifier is vague. Assuming (as does Sider) that the “connectedness” of objects can be precisely defined, I present a counter-example to Sider's contention, consisting of a partial, implicit definition of the (...) existential quantifier that in effect sets a given degree of connectedness among the putative parts of an object as a condition upon there being something (in the sense in question) with those parts. I then argue that such an implicit definition, taken together with an “auxiliary logic” (e.g., introduction and elimination rules), proves to function as a precisification in just the same way as paradigmatic precisifications of, e.g., “red”. I also argue that with a quantifier that is stipulated as maximally tolerant as to what mereological sums there are, precisifications can be given in the form of truth-conditions of quantified sentences, rather than by implicit definition. (shrink)

The paper reviews a number of approaches for handling restricted quantification in relevant logic, and proposes a novel one. This proceeds by introducing a novel kind of enthymematic conditional.

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)

In my paper, I present two competing perspectives on the foundational problem (as opposed to the descriptive problem) of quantifier domain restriction: the objective perspective on context (OPC) and the intentional perspective on context (IPC). According to OPC, the relevant domain for a quantified sentence is determined by objective facts of the context of utterance. In contrast, according to IPC, we must consider certain features of the speaker’s intention in order to determine the proposition expressed. My goal is to offer (...) a plausible and fair reconstruction of IPC. Drawing a parallel between quantifier domain restriction and standard cases of context dependence as indexicality, I argue that the speaker’s intentions can play a semantic role only if they satisfy an Availability Constraint: an intention must be made available or communicated to the addressee, and for that purpose the speaker can exploit any feature of the objective context (words, gestures, relevance or uniqueness of either the quantificational domain or of the referent in the context of utterance). An intention satisfying the Availability Constraint must be something that a hearer in normal circumstances is able to work out by relying on the physical surroundings of the utterance situation, on utterances exchanged during the previous conversation, and on background knowledge shared by speaker and addressee. (shrink)

Formal semantics has so far focused on three categories of quantifiers, to wit, Q-determiners (e.g. 'every'), Q-adverbs (e.g. 'always'), and Q-auxiliaries (e.g. 'would'). All three can be analyzed in terms of tripartite logical forms (LF). This paper presents evidence from verbs with distributive affixes (Q-verbs), in Kalaallisut, Polish, and Bininj Gun-wok, which cannot be analyzed in terms of tripartite LFs. It is argued that a Q-verb involves discourse reference to a distributive verbal dependency, i.e. an episode-valued function that sends different (...) semantic objects in a contextually salient plural domain to different episodes. (shrink)

The paper proposes an account of the contrast (noticed in Karttunen 1976) between the interpretations of the following two discourses: Harvey courts a girl at every convention. {She is very pretty. vs. She always comes to the banquet with him.}. The initial sentence is ambiguous between two quantifier scopings, but the first discourse as a whole allows only for the wide-scope indefinite reading, while the second allows for both. This cross-sentential interaction between quantifier scope and anaphora is captured by means (...) of a new dynamic system couched in classical type logic, which extends Compositional DRT (Muskens 1996) with plural information states (modeled, following van den Berg 1996, as sets of variable assignments). Given the underlying type logic, compositionality at sub-clausal level follows automatically and standard techniques from Montague semantics become available. The paper also shows that modal subordination (A wolf might come in. It would eat Harvey first) can be analyzed in a parallel way, i.e. the system captures the anaphoric and quantificational parallels between the individual and modal domains argued for in Stone (1999) (among others). In the process, we see that modal / individual-level quantifiers enter anaphoric connections as a matter of course, usually functioning simultaneously as both indefinites and pronouns. (shrink)

The paper proposes the first unified account of deictic/sentence-external and sentence-internal readings of singular different . The empirical motivation for such an account is provided by a cross-linguistic survey and an analysis of the differences in distribution and interpretation between singular different , plural different and same (singular or plural) in English. The main proposal is that distributive quantification temporarily makes available two discourse referents within its nuclear scope, the values of which are required by sentence-internal uses of singular different (...) to be distinct, much as its deictic uses require the values of two discourse referents to be distinct. Thus, we take sentence-internal readings to be a form of ‘association with distributivity’ that is similar to association with focus. The contrast between singular different , plural different and same is explained in terms of several kinds of quantificational distributors that license their internal readings. The analysis is executed in a stack-based dynamic system couched in type logic, so we get compositionality in the usual Montagovian way. Quantificational subordination and dependent indefinites in various languages provide additional motivation for the account. Investigating the connections between items with sentence-internal readings and the quantificational licensors of these readings opens up a larger project of formally investigating (i) the typology of quantificational distributors and distributivity-dependent items and (ii) the fine-grained contexts of evaluation needed to capture this typological variation. (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 paper proposes a novel solution to the problem of scope posed by natural language indefinites that captures both the difference in scopal freedom between indefinites and bona fide quantifiers and the syntactic sensitivity that the scope of indefinites does nevertheless exhibit. Following the main insight of choice functional approaches, we connect the special scopal properties of indefinites to the fact that their semantics can be stated in terms of choosing a suitable witness. This is in contrast to bona fide (...) quantifiers, the semantics of which crucially involves relations between sets of entities. We provide empirical arguments that this insight should not be captured by adding choice/Skolem functions to classical first-order logic, but in a semantics that follows Independence-Friendly Logic, in which scopal relations involving existentials are part of the recursive definition of truth and satisfaction. These scopal relations are resolved automatically as part of the interpretation of existentials. Additional support for this approach is provided by dependent indefinites, a cross-linguistically common class of special indefinites that can be straightforwardly analyzed in our semantic framework. (shrink)

Two fundamental rules of reasoning are Universal Generalisation and Existential Instantiation. Applications of these rules involve stipulations (even if only implicitly) such as ‘Let n be an arbitrary number’ or ‘Let John be an arbitrary Frenchman’. Yet the semantics underlying such stipulations are far from clear. What, for example, does ‘n’ refer to following the stipulation that n be an arbitrary number? In this paper, we argue that ‘n’ refers to a number—an ordinary, particular number such as 58 or 2,345,043. (...) Which one? We do not and cannot know, because the reference of ‘n’ is fixed arbitrarily. Underlying this proposal is a more general thesis: Arbitrary Reference (AR): It is possible to fix the reference of an expression arbitrarily. When we do so, the expression receives its ordinary kind of semantic-value, though we do not and cannot know which value in particular it receives. Our aim in this paper is defend AR. In particular, we argue that AR can be used to provide an account of instantial reasoning (one that is better than the prominent alternatives), and we suggest that AR can also figure in offering new solutions to a range of difficult philosophical puzzles. (shrink)

We consider connections between number sense—the ability to judge number—and the interpretation of natural language quantifiers. In particular, we present empirical evidence concerning the neuroanatomical underpinnings of number sense and quantifier interpretation. We show, further, that impairment of number sense in patients can result in the impairment of the ability to interpret sentences containing quantifiers. This result demonstrates that number sense supports some aspects of the language faculty.

The problematic features of Quine's set theories NF and ML are a result of his replacing the higher-order predicate logic of type theory by a first-order logic of membership, and can be resolved by returning to a second-order logic of predication with nominalized predicates as abstract singular terms. We adopt a modified Fregean position called conceptual realism in which the concepts (unsaturated cognitive structures) that predicates stand for are distinguished from the extensions (or intensions) that their nominalizations denote as singular (...) terms. We argue against Quine's view that predicate quantifiers can be given a referential interpretation only if the entities predicates stand for on such an interpretation are the same as the classes (assuming extensionality) that nominalized predicates denote as singular terms. Quine's alternative of giving predicate quantifiers only a substitutional interpretation is compared with a constructive version of conceptual realism, which with a logic of nominalized predicates is compared with Quine's description of conceptualism as a ramified theory of classes. We argue against Quine's implicit assumption that conceptualism cannot account for impredicative concept-formation and compare holistic conceptual realism with Quine's class Platonism. (shrink)

(1) Singular terms Singular term : a word or phrase that refers to an individual object; its semantic value is an object.

Several recent papers propose that child and adult grammars differ in their underlying representations of universal quantification, e.g., “every” in English. These proposals attempt to explain children’s nonadult responses, in certain circumstances, in response to sentences that contain the universal quantifier. Blaming children’s nonadult behavior on their grammars is questionable, however, in view of the restrictiveness of the theory of Universal Grammar, which tightly constrains the hypothesis space children can navigate in the course of language development. The restrictiveness of the (...) initial state has led to the Continuity Hypothesis, i.e., the proposal that child language can differ from the local language only in ways in which distinct adult languages can differ from each other. Advocates of the Continuity Hypothesis point out that violations of universal constraints in children’s grammars would have far reaching negative consequences, resulting in myriad ‘errors’ by children both in production and comprehension. Before embracing an analysis that involves such violations, therefore, evidence that children make such errors is needed. In this paper, we draw out the implications of a recent account of children’s nonadult interpretation of universal quantification, by Geurts (2004). We demonstrate that children commit few, if any, any of the ‘errors’ that are predicted by the account, beyond the original nonadult behavior that it was specifically designed to explain. Moreover, the proposed analysis of children’s nonadult grammar is demonstrably inconsistent with their proven semantic competence in interpreting a variety of utterances containing the universal quantifier, alone and in combination with other logical expressions (e.g., disjunction, negative determiner phrases, etc.). These findings buttress previous alternative accounts of the observed differences between children and adults, thereby leaving the Continuity Hypothesis unscathed. (shrink)

The currently standard philosophical conception of existence makes a connection between three things: certain ways of talking about existence and being in natural language; certain natural language idioms of quantification; and the formal representation of these in logical languages. Thus a claim like ‘Prime numbers exist’ is treated as equivalent to ‘There is at least one prime number’ and this is in turn equivalent to ‘Some thing is a prime number’. The verb ‘exist’, the verb phrase ‘there is’ and the (...) quantifier ‘some’ are treated as all playing similar roles, and these roles are made explicit in the standard common formalization of all three sentences by a single formula of first-order logic: ‘(∃ x )[P( x ) & N( x )]’, where ‘P( x )’ abbreviates ‘ x is prime’ and ‘N( x )’ abbreviates ‘ x is a number’. The logical quantifier ‘∃’ accordingly symbolizes in context the role played by the English words ‘exists’, ‘some’ and ‘there is’. (shrink)

Quine introduced a famous distinction between the ‘notional’ sense and the ‘relational’ sense of certain attitude verbs. The distinction is both intuitive and sound but is often conflated with another distinction Quine draws between ‘dyadic’ and ‘triadic’ (or higher degree) attitudes. I argue that this conflation is largely responsible for the mistaken view that Quine’s account of attitudes is undermined by the problem of the ‘exportation’ of singular terms within attitude contexts. Quine’s system is also supposed to suffer from the (...) problem of ‘suspended judgement with continued belief’. I argue that this criticism fails to take account of a crucial presupposition of Quine’s about the connection between thought and language. The aim of the paper is to defend the spirit of Quine’s account of attitudes by offering solutions to these two problems. (shrink)

The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semanticinterpretations can be formalized in linear logic in a way thatcorrectly explains the observed interactions between quantifier scopeambiguity, bound anaphora and intensionality.Our linear-logic formalization of the compositional properties ofquantifying expressions in natural language obviates the need forspecial mechanisms, such as Cooper storage, in representing thescoping possibilities of quantifying expressions. Instead, thesemantic contribution of a quantifier is recorded as a linear-logicformula whose use in a proof will establish the (...) scope of thequantifier. Different proofs can lead to different scopes. In eachcomplete proof, the properties of linear logic ensure thatquantifiers are properly scoped. (shrink)

In this paper I revive two important formal approaches to the interpretation of natural language, that of Montague and that of Karttunen and Peters. Armed with insights from dynamic semantics (Heim, Krifka) the two turn out to stand up against age-old criticisms in an orthodox fashion. The plan is mainly methodological, as I only want to illustrate the technical feasibility of the revived proposals. Even so, there are illuminating and welcome empirical consequences on the subject of scope islands (as discussed (...) by Abusch and Kratzer, among many others), as well as unintended theoretical implications in the contextualist debate (Grice, Recanati, Simons, Stanley, and many others again). (shrink)

There are enormous differences between quantifying name-variables only, quantifying verb-variables only, and quantifying both. These differences are found only in the logic of polyadic predication; and this presumably is why Richard Gaskin thinks that they distinguish names from transitive verbs only, and not from verbs generally. But that thought is mistaken: these differences also distinguish names from intransitive verbs. They thus vindicate the common idea that on the difference between names and verbs we may base grandiose metaphysical distinctions, and undermine (...) Gaskin's idea that both names and verbs may be said to designate objects. (shrink)

This paper offers a new unified theory about the meaning of the imperfective and progressive aspects that builds on earlier of analyses in the literature that treat the imperfective as denoting a universal quantifier (e.g. Bonomi, Linguist Philos, 20(5):469–514, 1997; Cipria and Roberts, Nat Lang Semant 8(4):297–347, 2000). It is shown that the problems associated with such an analysis can be overcome if the domain of the universal quantifier is taken to be a partition of a future extending interval into (...) equimeasured cells. Treating the partition-measure (the length of each partition-cell) as a contextually dependent variable allows for a unified treatment of the habitual and event-in-progress readings of the imperfective. It is argued that the contrast between the imperfective and the progressive has to do with whether the quantifier domain is a regular partition of the reference interval or a superinterval of the reference interval. (shrink)

One of the logical problems with which Arthur Prior struggled is the problem of finding, in Prior’s own phrase, a “logic for contingent beings.” The difficulty is that from minimal modal principles and classical quantification theory, it appears to follow immediately that every possible object is a necessary existent. The historical development of quantified modal logic (QML) can be viewed as a series of attempts---due variously to Kripke, Prior, Montague, and the fee-logicians---to solve this problem. In this paper, I review (...) the extant solutions, finding them all wanting. Then I suggest a new solution inspired by Kripke’s theory of rigid designation and Kaplan’s logic of demonstratives, the latter in particular. It turns out that the basic mechanism of Kaplan’s logic can be exploited to yield a version of QML that will serve as a viable logic for contingent beings. This result, as I show, sheds new light on the problems of singular negative existential propositions, the question of actualism, the question of the existence of the contingent a priori, the relation between logical truth and necessity, and various modal problems and paradoxes going back to Chrysippus, Ramsey, and Moore. (shrink)

Standard first-order logic plus quantifiers of all finite orders (SFOL) faces four well-known difficulties when used to characterize the behavior of certain English quantifier phrases. All four difficulties seem to stem from the typed structure of SFOL models. The typed structure of SFOL models is in turn a product of an asymmetry between the meaning of names and the meaning of predicates, the element-set asymmetry. In this paper we examine a class of models in which this asymmetry of meaning is (...) removed. The models of this class permit definitions of the quantifiers which allow a desirable flexibility in fixing the domain of quantification. Certain SFOL type restrictions are thereby avoided. The resulting models of English validate all of the standard first-order logical truths and are free of the four deficiencies of SFOL models. (shrink)

and Data The essence of scope in natural language semantics can be characterized as follows: an expression e1 takes scope over an expression e2 iff the interpretation of the former affects the interpretation of the latter. Consider, for example, the sentence in (1) below, which is typical of the cases discussed in this paper in that it involves an indefinite and a universal (or, more generally, a non-existential) quantifier. (1) Everyx student in my class read ay paper about scope. How (...) can we tell whether the indefinite in (1) is in the scope of the universal or not? We can answer this question in two ways. From a dependence-based perspective, Q y is in the scope of Qx if the values of the variable y (possibly) covary with the values of x. From an independence-based perspective, Q y is outside the scope of Qx if y’s value is fixed relative to the values of x. This brings us to the first of our two central questions: should the scopal properties of ordinary, ‘unmarked’ indefinites be characterized in terms of dependence or in terms of independence? The difference between these two conceptualizations is that a dependence-based approach establishes which quantifier(s) Q y is dependent on, while an independence-based approach establishes which quantifier(s) Q y is independent of. Logical semantics has taken both paths to the notion of scope: compare the standard, dependence-based semantics of first-order logic (FOL) – or the dependence-driven Skolemization procedure – with the independence-based semantics of Independence-Friendly Logic (IFL, Hintikka 1973, Sandu 1993, Hodges 1997, Väänänen 2007 among others). Natural language semantics has only taken the dependence-based path. (shrink)

Conservativity in generalized quantifiers is linked to presupposition filtering, under a propositions-as-types analysis extended with dependent quantifiers. That analysis is underpinned by modeltheoretically interpretable proofs which inhabit propositions they prove, thereby providing objects for quantification and hooks for anaphora.

There are four broad grounds upon which the intelligibility of quantification over absolutely everything has been questioned—one based upon the existence of semantic indeterminacy, another on the relativity of ontology to a conceptual scheme, a third upon the necessity of sortal restriction, and the last upon the possibility of indefinite extendibility. The argument from semantic indeterminacy derives from general philosophical considerations concerning our understanding of language. For the Skolem–Lowenheim Theorem appears to show that an understanding of quanti- fication over absolutely (...) everything (assuming a suitably infinite domain) is semantically indistinguishable from the understanding of quantification over something less than absolutely everything; the same first-order sentences are true and even the same first-order conditions will be satisfied by objects from the narrower domain. From this it is then argued that the two kinds of understanding are indistinguishable tout court and that nothing could count as having the one kind of understanding as opposed to the other. (shrink)

Claims: A. Shared assumption (1) needs to be modified. The argument of a restrictive quantifier phrase, QP, (at least when there is Inverse Scope) is a partial function defined only for individuals that satisfy the restrictor: (3'a) a. λP.[[book]] ⊆ P b.

Collective entities and collective relations play an important role in natural language. In order to capture the full meaning of sentences like The Beatles sing Yesterday, a knowledge representation language should be able to express and reason about plural entities — like the Beatles — and their relationships — like sing — with any possible reading (cumulative, distributive or collective).In this paper a way of including collections and collective relations within a concept language, chosen as the formalism for representing the (...) semantics of sentences, is presented. A twofold extension of theA–C concept language is investigated: (1) special relations introduce collective entities either out of their components or out of other collective entities, (2) plural quantifiers on collective relations specify their possible reading. The formal syntax and semantics of the concept language is given, together with a sound and complete algorithm to compute satisfiability and subsumption of concepts, and to compute recognition of individuals. (shrink)

The first edition of the Handbook of Philosophical Logic (four volumes) was published in the period 1983-1989 and has proven to be an invaluable reference work ...

Classical generalized quantifier (GQ) theory posits that quantificational determiners (Q-dets) combine with a nominal argument of type et, a first order predicate, to form a GQ. In a recent paper, Matthewson (2001) challenges this position by arguing that the domain of a Q-det is not of type et, but e, an entity. In this paper, I defend the classical GQ view, and argue that the data that motivated Matthewson’s revision actually suggest that the domain set can, and indeed in certain (...) languages must, be contextually restricted overtly. (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)

Adding branching quantification to a first-order language increases the expressive power of the language,without adding to its ontology. The present paper is a defense of this claim against Quine (1970) and Patton (1991).

Sider argues that, of maximalism and quantifier variance, the latter promises to let us make better sense of neo-Fregeanism. I argue that neo-Fregeans should, and seemingly do, reject quantifier variance. If they must choose between these two options, they should choose maximalism.

A sense of unity -- Basic objects : a reply to Xu -- Objectivity without objects -- The vagueness of identity -- Quantifier variance and realism -- Against revisionary ontology -- Comments on Theodore Sider's four dimensionalism -- Sosa's existential relativism -- Physical-object ontology, verbal disputes, and common sense -- Ontological arguments : interpretive charity and quantifier variance -- Language, ontology, and structure -- Ontology and alternative languages.

Whether or not there are non-existent objects seems to be one of the more mysterious and speculative issues in ontology.1 To affirm that there are non-existent objects is to affirm that reality consists of two kinds of things, the existing and the non-existing. The existing contains all of what is in our space-time world, plus all abstract objects, if there are any. Most people, it seems fair to say, would think that this is all there is. For them the only (...) real question in ontology can be what kinds of existing things there are. However, followers of Meinong maintain that this isn’t all there is. There is also another kind of things, those that do not exist. And to say this, the Meinongians continue, is to accept that reality is divided into two basic kinds of things, the existing and the non-existing. Whether or not reality contains two basic categories of things, existing and non-existing, or only one, existing, is what the debate about non-existent objects is all about. And as such it seems to be the most speculative of the debates in ontology. How could we human beings possibly decide it? One might think that to find out whether or not there are abstract objects is hard to decide, since they are not in space and time, causally inaccessible, unobservable, etc.. But whatever difficulty there might be to answer the question whether or not there are abstract objects, it has to be even harder to decide whether or not there are non-existent objects. Abstract objects, if there are any, at least.. (shrink)

Peter Geach proposed a substitutional construal of quantification over thirty years ago. It is not standardly substitutional since it is not tied to those substitution instances currently available to us; rather, it is pegged to possible substitution instances. We argue that (i) quantification over the real numbers can be construed substitutionally following Geach's idea; (ii) a price to be paid, if it is that, is intuitionism; (iii) quantification, thus conceived, does not in itself relieve us of ontological commitment to real (...) numbers. (shrink)

Henkin quantifiers have been introduced in Henkin (1961). Walkoe (1970) studied basic model-theoretical properties of an extension L * 1(H) of ordinary first-order languages in which every sentence is a first-order sentence prefixed with a Henkin quantifier. In this paper we consider a generalization of Walkoe's languages: we close L * 1(H) with respect to Boolean operations, and obtain the language L 1(H). At the next level, we consider an extension L * 2(H) of L 1(H) in which every sentence (...) is an L 1(H)-sentence prefixed with a Henkin quantifier. We repeat this construction to infinity. Using the (un)-definability of truth – in – N for these languages, we show that this hierarchy does not collapse. In addition, we compare some of the present results to the ones obtained by Kripke (1975), McGee (1991), and Hintikka (1996). (shrink)

Specificity has been defined in the linguistic literature according to two different criteria: one corresponding to Quine's opaque and transparent contexts, and the other to criteria closely related to Donellan's referential/attributive distinction. The paper argues that only the former definition is a semantic one since it alone manifests linguistic correlates. The meaning changes involving referential/attributive factors are pragmatic in nature. In the concluding section is is argued that the semantics of specificity is completely independent of the relative scope interpretation of (...) an indefinite noun phrase in relation to other quantified nouns in the sentence. This is demonstrated using sentences which contain an indefinite interacting with both an opaque operator and a second quantifier. It is shown that such sentences can be four ways ambiguous. (shrink)

A method now popular for fixing the scopes of arguments involves a covert movement operation, named QR (for Quantifier Rule) by Robert May. May envisioned QR as a kind of adjunction operation, attaching the arguments so affected to phrases dominating that argument. From the surface representation in (1a), for instance, QR can fashion the representations in (1b) and (1c) by adjoining the object and/or subject argument to IP. (1) a. [IP Someone [VP loves everyone ]]. b. [IP everyone1 [IP someone (...) [VP loves t1 ]]]. c. [IP someone2 [IP everyone1 [IP t2 [VP loves t1 ]]]] As the representations in (1a,b) suggest, QR has syntactic consequences rather like those displayed by Topicalization, the process that derives (2b) from (2a). (shrink)

One of the fascinations of Sluicing – one that figured in Ross’s (1969) original exploration of the construction – is that it seems to overcome many island effects. Most speakers find contrasts between the pairs of sentences in (1) and (2), for instance.

It is shown that for arithmetical interpretations that may include free variables it is not the Guaspari-Solovay system R that is arithmetically complete, but their system R –. This result is then applied to obtain the nonvalidity of some rules under arithmetical interpretations including free variables, and to show that some principles concerning Rosser orderings with free variables cannot be decided, even if one restricts oneself to usual proof predicates.

In this paper, a theory T H based on combining type freeness with logic is introduced and is then used to build a theory of properties which is applied to determiners and quantifiers.

In this paper, I show that the availability of what some authors have called the weak reading and the strong reading of donkey sentences with relative clauses is systematically related to monotonicity properties of the determiner. The correlation is different from what has been observed in the literature in that it concerns not only right monotonicity, but also left monotonicity (persistence/antipersistence). I claim that the reading selected by a donkey sentence with a double monotone determiner is in fact the one (...) that validates inference based on the left monotonicity of the determiner. This accounts for the lack of strong reading in donkey sentences with MON determiners, which have been neglected in the literature. I consider the relevance of other natural forms of inference as well, but also suggest how monotonicity inference might play a central role in the actual process of interpretation. The formal theory is couched in dynamic predicate logic with generalized quantifiers. (shrink)

In Research on Language and Computation, Co-editor with Alastair Butler (primary editor) and Jason Mattausch of the special issue. Vol: 5.1 Springer Verlag.

Within Linguistics the semantic analysis of natural languages (English, Swahili, for example) has drawn extensively on semantical concepts first formulated and studied within classical logic, principally first order logic. Nowhere has this contribution been more substantive than in the domain of quantification and variable binding. As studies of these notions in natural language have developed they have taken on a life of their own, resulting in refinements and generalizations of the classical quantifiers as well as the discovery of new types (...) of quantification which exceed the expressive capacity of the classical quantifiers. We refer the reader to Keenan and Westerståhl (1997) for an overview of results in this area. Here, we focus on one property of quantification in natural language?its inherently sortal nature?which distinguishes it from quantification in classical logic. (shrink)

In sentences likeEvery teacher laughed we think ofevery teacher as aunary (=type ) quantifier — it expresses a property ofone place predicate denotations. In variable binding terms, unary quantifiers bind one variable. Two applications of unary quantifiers, as in the interpretation ofNo student likes every teacher, determine abinary (= (type ) quantifier; they express properties oftwo place predicate denotations. In variable binding terms they bind two variables. We call a binary quantifierFregean (orreducible) if it can in principle be expressed by (...) the iterated application of unary quantifiers.In this paper we present two mathematical properties which distinguish non-Fregean quantifiers from Fregean ones. Our results extend those of van Benthem (1989) and Keenan (1987a). We use them to show that English presents a large variety of non-Fregean quantifiers. Some are new here, others are familiar (though the proofs that they are non-Fregean are not). (shrink)

Erratum to: Stanley Peters and Dag Westerståhl: Quantifiers in language and logic Content Type Journal Article Category Erratum Pages 1-1 DOI 10.1007/s10988-011-9094-5 Authors Edward L. Keenan, Department of Linguistics, University of California at Los Angeles, 3125 Campbell Hall, Los Angeles, CA 90095-1543, USA Denis Paperno, Department of Linguistics, University of California at Los Angeles, 3125 Campbell Hall, Los Angeles, CA 90095-1543, USA Journal Linguistics and Philosophy Online ISSN 1573-0549 Print ISSN 0165-0157.

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)

to appear in Lisa Matthewson (ed.), Cross-linguistic perspectives on the semantics of quantification, Elsevier.