There is a good deal of disagreement about composition. There is firstorder disagreement: there are radically different answers to the special composition question—the question of under what circumstances the xs compose a y. There is second-order disagreement: there are different answers to the question of whether first-order disagreement is real or merely semantic. Virtually all disputants with respect to both the first-and second-order issues agree that the answer or answers to the special composition question will take the form of a (...) necessary truth or truths even though, as I will argue, such answers do not appear to be good candidates to be necessary truths. This paper provides an analysis of the concept of as it pertains to concrete objects, that fulfils two functions. First, it explicates the sense in which claims about composition are contingent and the sense in which they are necessary, and second, it provides a way of understanding when first-order disputes are substantial and when they are merely semantic. (shrink)

This article discusses a relation between the formal science of logical semantics and some monotheistic, polytheistic and Trinitarian Christian notions. This relation appears in the use of the existential quantifier and of logical-modal notions when some monotheistic and polytheistic concepts and, principally, the concept of Trinity Dogma are analyzed. Thus, some presupposed modal notions will appear in some monotheistic propositions, such as the notion of “logically necessary”. From this, it will be shown how the term “God” is a (...) polysemic term and is often treated as both subject and predicate. This will make it clear that there is no plausible intellectual justification for believing that the term “God” can only be used as a name and never as a predicate, and vice versa. After that analysis, I will show that the conjunction of the “Trinity Dogma” with some type of “monotheistic position” would necessarily imply some class of absurdity and/or semantic “oddity”. (shrink)

Within the context of the debate between ontological monists and pluralists the paper discusses a number of argumentative strategies that the latter can apply to answer the “there can be only one” argument. I show here that the reply to this argument suggested by J. Turner has its disadvantages and suggest a number of adjustments thereof. In particular, I develop a concept of domain-specific quantifiers that allow the pluralist to elaborate his or her ontological position.

Following Panaccio, 'John believes that p' is analysed as 'For some x such that x is true if and only if p, John believes x'. On this view the complement clause 'that p' acts as a restricted existential quantifier and it contributes a higher-order property.

This paper draws a distinction between the existential quantifier and the symbol ‘∃’ used to express it, on the one hand, and existence and ‘exists’, on the other. It argues that some popular arguments in metaphysics, including arguments against vague existence and arguments against deflationary metaontology (which views ontological disputes as lacking substance), are guilty of fudging this distinction. The paper draws some lessons for metaphysical debate about existence and highlights some heretofore ignored and attractive positions in logical (...) space. (shrink)

In this paper an alternative Skolemization method is introduced that, for a large class of formulas, is sound and complete with respect to intuitionistic logic. This class extends the class of formulas for which standard Skolemization is sound and complete and includes all formulas in which all strong quantifiers are existential. The method makes use of an existence predicate first introduced by Dana Scott.

Previous theorists have claimed that Russell’s theory of definite descriptions gives the wrong truth conditions to sentences in which definite descriptions are embedded under certain other operators; but the other operators used, such as conditionals and propositional attitude verbs, have introduced intensional and hyperintensional complications that might be thought to obscure the point against Russell. This paper shows that the same kind of problem arises when the operator in question allows the context to be extensional. It is further argued that (...) presuppositional theories of definite descriptions give intuitively satisfying analyses of the novel data. (shrink)

People accept conclusions of valid conditional inferences (e.g., if p then q, p therefore q) less, the more disablers (circumstances that prevent q to happen although p is true) exist. We investigated whether rules that through their phrasing exclude disablers evoke higher acceptance ratings than rules that do not exclude disablers. In three experiments we re-phrased content-rich conditionals from the literature as either universal or existential rules and embedded these rules in Modus Ponens and Modus Tollens inferences. In Experiments (...) 2 and 3, we also used abstract rules. The acceptance of conclusions increased when the rule was phrased with “all” instead of “some” and the number of disablers had a higher impact on existential rules than on universal rules. Further, the effect of quantifier was more pronounced for abstract rules and when tested within subjects. We discuss the relevance of phrasing, quantifiers and knowledge on reasoning. (shrink)

We are concerned with showing how ‘labelled’ Natural Deduction presentation systems based on an extension of the so-called Curry-Howard functional interpretation can help us understand and generalise most of the deduction calculi designed to deal with the logical notion of existential quantification. We present the labelling mechanism for ‘’ using what we call ‘ɛ-terms’, which have the form of ‘a’) in a dual form to the ‘Ax.f’ terms of in the sense that the ‘witness’ is chosen at the time (...) of assertion/introduction.With the intention of demonstrating the generality of our framework, we provide a brief comparison with some other calculi of existentials, including the model-theoretic interpretations of Skolem and Herbrand, indicating the way in which some of the classical results on prenex normal forms can be extended to a wide range of logics. The essential ingredient is to look at the conceptual framework of labelled natural deduction as an attempted reconstruction of Frege's functional calculus where the devices of the Begriffsschrift work separately from, yet in harmony with, those of the Grundgesetze 1. (shrink)

Human civilisation faces a range of existential risks, including nuclear war, runaway climate change and superintelligent artificial intelligence run amok. As we show here with calculations for the New Zealand setting, large numbers of currently living and, especially, future people are potentially threatened by existential risks. A just process for resource allocation demands that we consider future generations but also account for solidarity with the present. Here we consider the various ethical and policy issues involved and make a (...) case for further engagement with the New Zealand public to determine societal values towards future lives and their protection. (shrink)

This paper suggests that quantified negative existentials about fiction—statements of the form “There are some / many / etc. Fs in work W who don't exist”—offer a serious challenge to the theorist of fiction: more serious, in a number of ways, that singular negative existentials. I argue that the temptation to think that only a realist semantics of such statements is plausible should be resisted. There are numerous quantified negative existentials found in other areas that seem equally “true” but where (...) a realist semantics imports ontological commitments that few would want to embrace. In the final part of the paper I sketch an alternative pretense account of one such quantified negative existential, and suggest that the account gives us some reason to believe that quantified negative existentials in general, including quantified negative existentials about fiction, can also be understood in pretense terms. (shrink)

The paper argues that the view that the particular quantifier is ‘existentially loaded’ is a relatively new one historically and that it has become entrenched in modern philosophical logic for less than happy reasons.

We analyze the behaviour of declarations of independence between existential quantifiers in quantifier prefixes of Independence-Friendly (IF) sentences; we give a syntactical criterion to decide whether a sentence beginning with such prefix exists, such that its truth values may be affected by removal of the declaration of independence. We extend the result also to equilibrium semantics values for undetermined IF sentences.

We introduce a two-valued and a three-valued truth-valuational substitutional semantics for the Quantified Argument Calculus (Quarc). We then prove that the 2-valid arguments are identical to the 3-valid ones with strict-to-tolerant validity. Next, we introduce a Lemmon-style Natural Deduction system and prove the completeness of Quarc on both two- and three-valued versions, adapting Lindenbaum’s Lemma to truth-valuational semantics. We proceed to investigate the relations of three-valued Quarc and the Predicate Calculus (PC). Adding a logical predicate T to Quarc, true of (...) all singular arguments, allows us to represent PC quantification in Quarc and translate PC into Quarc, preserving validity. Introducing a weak existential quantifier into PC allows us to translate Quarc into PC, also preserving validity. However, unlike the translated systems, neither extended system can have a sound and complete proof system with Cut, supporting the claim that these are basically different calculi. (shrink)

We shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, where they behave like compact sets. The quantifier elimination theorems in this paper can be applied in a general setting to show that the family of neocompact (...) sets is countably compact. To provide the necessary setting we introduce the notion of a law structure. This notion was motivated by the probability law of a random variable. However, in this paper we discuss a variety of model theoretic examples of the notion in the light of our quantifier elimination results. (shrink)

If we must take mathematical statements to be true, must we also believe in the existence of abstract eternal invisible mathematical objects accessible only by the power of pure thought? Jody Azzouni says no, and he claims that the way to escape such commitments is to accept true statements which are about objects that don't exist in any sense at all. Azzouni illustrates what the metaphysical landscape looks like once we avoid a militant Realism which forces our commitment to anything (...) that our theories quantify. Escaping metaphysical straitjackets, while retaining the insight that some truths are about objects that do exist, Azzouni says that we can sort scientifically-given objects into two categories: ones which exist, and to which we forge instrumental access in order to learn their properties, and ones which do not, that is, which are made up in exactly the same sense that fictional objects are. He offers as a case study a small portion of Newtonian physics, and one result of his classification of its ontological commitments, is that it does not commit us to absolute space and time. (shrink)

In many languages, the same particles that form quantifier words also serve as connectives, additive and scalar particles, question markers, roots of existential verbs, and so on. Do these have a unified semantics, or do they merely bear a family resemblance? Are they aided by silent operators in their varied roles―if yes, what operators? I dub the particles “quantifier particles” and refer to them generically with capitalized versions of the Japanese morphemes. I argue that both MO and (...) KA can be assigned a stable semantics across their various roles. The specific analysis I offer is motivated by the fact that MO and KA often combine with just one argument; I propose that this is their characteristic behavior. Their role is to impose semantic requirements that are satisfied when the immediately larger context is interpreted as the meet/join of their host’s semantic contribution with something else. They do not perform meet/join themselves. The obligatory vs. optional appearance of the particles depends on whether the meet/join interpretations arise by default in the given constellation. I explicate the proposal using the toolkit of basic Inquisitive Semantics. (shrink)

The aim of the paper is to bring clarity regarding the doctrine of quantifier variance (due to Eli Hirsch), and two prominent arguments against this doctrine, the collapse argument and the Eklund-Hawthorne argument. Different versions of the doctrine of quantifier variance are distinguished, and it is shown that the effectiveness of the arguments against it depends on what version of the doctrine is at issue. The metaontological significance of the different versions of the doctrine are also assessed. Roughly, (...) quantifier variance concerns there being different possible existential quantifier meanings, and often the doctrine involves a claim to the effect there is no unique “best” quantifier meaning. Much of the discussion in the paper concerns what it is to be an existential quantifier meaning in the sense at issue. (shrink)

In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed in polynomial time. (...) Additionally, we suggest that plausible semantic theories of the everyday fragment of natural language can be formulated in the existential fragment of second-order logic. -/- In Chapter 2 we give an overview of the basic notions of generalized quantifier theory, computability theory, and descriptive complexity theory. -/- In Chapter 3 we prove that PTIME quantifiers are closed under iteration, cumulation and resumption. Next, we discuss the NP-completeness of branching quantifiers. Finally, we show that some Ramsey quantifiers define NP-complete classes of finite models while others stay in PTIME. We also give a sufficient condition for a Ramsey quantifier to be computable in polynomial time. -/- In Chapter 4 we investigate the computational complexity of polyadic lifts expressing various readings of reciprocal sentences with quantified antecedents. We show a dichotomy between these readings: the strong reciprocal reading can create NP-complete constructions, while the weak and the intermediate reciprocal readings do not. Additionally, we argue that this difference should be acknowledged in the Strong Meaning hypothesis. -/- In Chapter 5 we study the definability and complexity of the type-shifting approach to collective quantification in natural language. We show that under reasonable complexity assumptions it is not general enough to cover the semantics of all collective quantifiers in natural language. The type-shifting approach cannot lead outside second-order logic and arguably some collective quantifiers are not expressible in second-order logic. As a result, we argue that algebraic (many-sorted) formalisms dealing with collectivity are more plausible than the type-shifting approach. Moreover, we suggest that some collective quantifiers might not be realized in everyday language due to their high computational complexity. Additionally, we introduce the so-called second-order generalized quantifiers to the study of collective semantics. -/- In Chapter 6 we study the statement known as Hintikka's thesis: that the semantics of sentences like ``Most boys and most girls hate each other'' is not expressible by linear formulae and one needs to use branching quantification. We discuss possible readings of such sentences and come to the conclusion that they are expressible by linear formulae, as opposed to what Hintikka states. Next, we propose empirical evidence confirming our theoretical predictions that these sentences are sometimes interpreted by people as having the conjunctional reading. -/- In Chapter 7 we discuss a computational semantics for monadic quantifiers in natural language. We recall that it can be expressed in terms of finite-state and push-down automata. Then we present and criticize the neurological research building on this model. The discussion leads to a new experimental set-up which provides empirical evidence confirming the complexity predictions of the computational model. We show that the differences in reaction time needed for comprehension of sentences with monadic quantifiers are consistent with the complexity differences predicted by the model. -/- In Chapter 8 we discuss some general open questions and possible directions for future research, e.g., using different measures of complexity, involving game-theory and so on. -/- In general, our research explores, from different perspectives, the advantages of identifying meaning with algorithms and applying computational complexity analysis to semantic issues. It shows the fruitfulness of such an abstract computational approach for linguistics and cognitive science. (shrink)

A propositional logic of explicit proofs, LP, was introduced in [S. Artemov, Explicit provability and constructive semantics, The Bulletin for Symbolic Logic 7 1–36], completing a project begun long ago by Gödel, [K. Gödel, Vortrag bei Zilsel, translated as Lecture at Zilsel’s in: S. Feferman , Kurt Gödel Collected Works III, 1938, pp. 62–113]. In fact, LP can be looked at in a more general way, as a logic of explicit evidence, and there have been several papers along these lines. (...) A major result about LP is the Realization Theorem, that says any theorem of S4 can be converted into a theorem of LP by some replacement of necessitation symbols with explicit proof terms. Thus the necessitation operator of S4 can be seen as a kind of implicit existential quantifier: there exists a proof term such that…. In this paper, quantification over evidence is introduced into LP, and it is shown that the connection between S4 necessitation and the existential quantifier becomes an explicit one. The extension of LP with quantifiers is called QLP. A semantics and an axiom system for QLP are given, soundness and completeness are established, and several results are proved relating QLP to LP and to S4. (shrink)

Let H be a proof system for quantified propositional calculus (QPC). We define the Σqj-witnessing problem for H to be: given a prenex Σqj-formula A, an H-proof of A, and a truth assignment to the free variables in A, find a witness for the outermost existential quantifiers in A. We point out that the Σq1-witnessing problems for the systems G*1and G1 are complete for polynomial time and PLS (polynomial local search), respectively. We introduce and study the systems G*0 and (...) G0, in which cuts are restricted to quantifier-free formulas, and prove that the Σqj-witnessing problem for each is complete for NC1. Our proof involves proving a polynomial time version of Gentzen’s midsequent theorem for G*0 and proving that G0-proofs are TC0-recognizable. We also introduce QPC systems for TC0 and prove witnessing theorems for them. We introduce a finitely axiomatizable second-order system VNC1 of bounded arithmetic which we prove isomorphic to Arai’s first order theory AID + Σb0-CA for uniform NC1. We describe simple translations of VNC1 proofs of all bounded theorems to polynomial size families of G*0 proofs. From this and the above theorem we get alternative proofs of the NC1 witnessing theorems for VNC1 and AID. (shrink)

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.

The provability problem in intuitionistic propositional second-order logic with existential quantifier and implication (∃,→) is proved to be undecidable in presence of free type variables (constants). This contrasts with the result that inutitionistic propositional second-order logic with existential quantifier, conjunction and negation is decidable.

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)

We refine the constructions of Ferrante-Rackoff and Solovay on iterated definitions in first-order logic and their expressibility with polynomial size formulas. These constructions introduce additional quantifiers; however, we show that these extra quantifiers range over only finite sets and can be eliminated. We prove optimal upper and lower bounds on the quantifier complexity of polynomial size formulas obtained from the iterated definitions. In the quantifier-free case and in the case of purely existential or universal quantifiers, we show (...) that Ω quantifiers are necessary and sufficient. The last lower bounds are obtained with the aid of the Yao-Håstad switching lemma. (shrink)

We shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, where they behave like compact sets. The quantifier elimination theorems in this paper can be applied in a general setting to show that the family of neocompact (...) sets is countably compact. To provide the necessary setting we introduce the notion of a law structure. This notion was motivated by the probability law of a random variable. However, in this paper we discuss a variety of model theoretic examples of the notion in the light of our quantifier elimination results. (shrink)

While opinions on the semantic analysis of generics vary widely, most scholars agree that generics have a quasi-universal flavor. However, there are cases where generics receive what appears to be an existentialinterpretation. For example, B's response is true, even though only theplatypus and the echidna lay eggs: (1) A: Birds lay eggs. B: Mammals lay eggs too. In this paper I propose a uniform account of the semantics of generics,which accounts for their quasi-existential readings as well as for their (...) more familiar quasi-universal ones. Generics are focus-sensitiveoperators: their domain is restricted by a set of alternatives, which may be provided by focus. I claim that, unlike otherfocus-sensitive operators, generics may, but do not have to, associate with focus. When alternatives are introduced, either by focus or by other means, generics get their usual quasi-universal readings. But when no alternatives are introduced, quasi-existential readings result.I argue that generics, unlike adverbs of quantification, do not introduce tripartite structures directly, but are initially interpreted as cases ofdirect kind predication. Only when this interpretation fails to make sense, the phonologically null generic quantifier is derived, and tripartite structures result. This two-level interpretation has the effect that while adverbs of quantification require focus to determine which elements go to the restrictor and which to the nuclear scope, and hence must associate with focus, generics do not, and hence may fail to associate with focus, resulting in quasi-existential readings. (shrink)

This paper offers a new semantic theory of existentials (sentences of the form There be NP pivot XP coda ) in which pivots are (second order) predicates and codas are modifiers. The theory retains the analysis of pivots as denoting generalized quantifiers (Barwise and Cooper 1981; Keenan 1987), but departs from previous analyses in analyzing codas as contextual modifiers on a par with temporal/locative frame adverbials. Existing analyses universally assume that pivots are arguments of some predicate, and that codas are (...) main or secondary predicates. It is shown that these analyses cannot account for the behavior of codas with quantifiers and for the interaction of multiple codas, both of which receive a simple treatment on the proposed theory. The assimilation of codas to frame adverbials explains several semantic properties which have not been analyzed in the semantic literature, and that distinguish existentials from their copular counterparts. Furthermore, it highlights important properties of the semantics of modification and its relation to predication. (shrink)

Eli Hirsch recently suggested the metaontological doctrine of so-called "quantifier variance", according to which ontological disputes—e.g. concerning the question whether arbitrary, possibly scattered, mereological fusions exist, in the sense that these are recognised as objects proper in our ontology—can be defused as insubstantial. His proposal is that the meaning of the quanti er `there exists' varies in such debates: according to one opponent in this dispute, some existential statement claiming the existence of, e.g., a scattered object is true, (...) according to the other it is not. This paper argues that Hirsch's proposal leads into inconsistency. (shrink)

We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quanti ers in terms of quanti er extensions of existential second-order logic.

Contemporary logicians continue to address problems associated with the existential import of categorical propositions. One notable problem concerns invalid instances of subalternation in the case of a universal proposition with an empty subject term. To remedy problems, logicians restrict first-order predicate logics to exclude such terms. Examining the historical origins of contemporary discussions reveals that logicians continue to make various category mistakes. We now believe that no proposition per se has existential import as commonly understood and thus it (...) is unnecessary to restrict first-order predicate logics to non-empty classes. After introducing the problem, we trace some nineteenth century treatments of the issue to locate a source of misconstruing propositional import in misconceptions of ‘implies’ and ‘affirms’ and name the process/product fallacy, along with the translation of categorical sentences using quantifiers and accommodating an empty class. Next we treat some metalogical matters to orient our discussion by which we provide a more precise nomenclature about ‘sentence’ and ‘proposition’ to correct previous misconceptions; here we uncover a common category mistake in respect of a proposition’s efficacy. The semantic distinction between agent and force is helpful in this connection. We conclude by showing that logicians have reinserted existence as a predicate, a position previously excised by Kant, and that the Frege-Russell ambiguity thesis applies only to relationships within a categorical sentence between grammatical predicate and subject. (shrink)

The paper uses the theory of generalized quantifiers to discuss existential import and its implications for Aristotelian logic, namely the square of opposition, conversions and the assertoric syllogistic, as well as for more recent generalizations to intermediate quantifiers like “most”. While this is a systematic discussion of the semantic background one should assume in order to obtain the inferences and oppositions Aristotle proposed, it also sheds some light on the interpretation of his writings. Moreover by applying tools from modern (...) formal semantics to the investigation of classical Aristotelian logic and its extensions, we combine different approaches to the logic of quantification. We will present variants of quantifiers that are associated to the four corners of the square of opposition with and without existential import and discuss their role for the logical square, conversions and the syllogistic. It will turn out that there is no way to ascribe existential import that validates all inferences and relations which one is willing to hold in Aristotelian logic. Two options, however, provide reasonable results. Existential import should either be ascribed only to affirmative statements or only be ascribed to universal quantification. The former option is preferable for a mere reconstruction of the classical Aristotelian logic while the latter option is more attractive if Aristotelian logic is generalized to intermediate quantifiers. (shrink)

The notion of grounding is usually conceived as an objective and explanatory relation. It connects two relata if one—the ground—determines or explains the other—the consequence. In the contemporary literature on grounding, much effort has been devoted to logically characterize the formal aspects of grounding, but a major hard problem remains: defining suitable grounding principles for universal and existential formulae. Indeed, several grounding principles for quantified formulae have been proposed, but all of them are exposed to paradoxes in some very (...) natural contexts of application. We introduce in this paper a first-order formal system that captures the notion of grounding and avoids the paradoxes in a novel and non-trivial way. The system we present formally develops Bolzano’s ideas on grounding by employing Hilbert’s ε-terms and an adapted version of Fine’s theory of arbitrary objects. (shrink)

The ramifications are explored of taking physical theories to commit their advocates only to ‘physically real’ entities, where ‘physically real’ means ‘causally efficacious’ (e.g., actual particles moving through space, such as dust motes), the ‘physically significant’ (e.g., centers of mass), and the merely mathematical—despite the fact that, in ordinary physical theory, all three sorts of posits are quantified over. It's argued that when such theories are regimented, existential quantification, even when interpreted ‘objectually’ (that is, in terms of satisfaction via (...) variables, rather than by substitution-instances) need not imply any ontological commitments. (shrink)

This volume covers a wide range of topics that fall under the 'philosophy of quantifiers', a philosophy that spans across multiple areas such as logic, metaphysics, epistemology, and even the history of philosophy. It discusses the import of quantifier variance in the model theory of mathematics. It advances an argument for the uniqueness of quantifier meaning in terms of Evert Beth’s notion of implicit definition, and clarifies the oldest explicit formulation of quantifier variance: the one proposed by (...) Rudolf Carnap. -/- The volume further examines what it means that a quantifier can have multiple meanings, and addresses how existential vagueness can induce vagueness in our modal notions. Finally, the book explores the role played by quantifiers with respect to various kinds of semantic paradoxes, the logicality issue, ontological commitment, and the behavior of quantifiers in intensional contexts. ​. (shrink)

This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the toolkit of Janin and Marcinkowski [JM01].We introduce an operation existsn on properties S that says "there are n components having S". We use this operation to show that under natural strictness conditions, adding a first order quantifier word u to the beginning of a prefix class V increases the expressive power monotonically in u. As a (...) corollary, if the first order quantifiers are not already absorbed in V, then both the quantifier alternation hierarchy and the existential quantifier hierarchy in the positive first order closure of V are strict.We generalize and simplify methods from Marcinkowski [Mar99] to uncover limitations of the expressive power of an additional first order quantifier, and show that for a wide class of properties S, S cannot belong to the positive first order closure of a monadic prefix class W unless it already belongs to W.We introduce another operation alt on properties which has the same relationship with the Circuit Value Problem as reach has with the Directed Reachability Problem. We use alt to show that Πn⊈ FO, Σn⊈ FO, and Δn+1⊈ FOB, solving some open problems raised in [Mat98]. (shrink)

It is widely believed that existential quantifiers can bring about the semantic effects of a scope which is wider than their actual syntactic scope (See Fodor & Sag (1982), Cresti (1995), Kratzer (1995), Reinhart (1995) and Winter (1995), among many others.) On the other hand, it is assumed that the syntactic scope of universal quantifiers can be determined unequivocally by the semantics. This paper shows that this second assumption is wrong; universal quantifiers can also bring about scope illusions, though (...) in a very specific environment. In particular, we argue that in the environment of generic tense, universal quantifiers can show the semantic effects of a scope which is wider than the one that is actually realized at LF. Our argument has four steps. First, we show that in generic contexts, universal quantifiers escape standard “scope-islands” (Section 1). Second, we show how the effects of wide scope in generic contexts can be achieved without syntactic wide scope (Section 2.1). Third, we show that this result is actually forced on us, once we take seriously certain independent issues concerning the interpretation of generic tense (Sections 2.2 - 2.4). Finally, the semantics of generic tense and, in particular, its interaction with focus, will yield some intricate new predictions, which, as we show, are borne out (Sections 3 - 5). (shrink)

An alternative notion of an existential quantifier on four-valued Łukasiewicz algebras is introduced. The class of four-valued Łukasiewicz algebras endowed with this existential quantifier determines a variety which is denoted by \. It is shown that the alternative existential quantifier is interdefinable with the standard existential quantifier on a four-valued Łukasiewicz algebra. Some connections between the new existential quantifier and the existential quantifiers defined on bounded distributive lattices and Boolean (...) algebras are given. Finally, a completeness theorem for the monadic four-valued Łukasiewicz predicate calculus corresponding to the dual of the alternative existential quantifier is proven. (shrink)

We characterize pairs of monotone generalized quantifiers Q1 and Q2 over finite domains that give rise to an entailment relation between their two relative scope construals. This relation between quantifiers, which is referred to as scope dominance, is used for identifying entailment relations between the two scopal interpretations of simple sentences of the form NP1–V–NP2. Simple numerical or set-theoretical considerations that follow from our main result are used for characterizing such relations. The variety of examples in which they hold are (...) shown to go far beyond the familiar existential-universal type. (shrink)

This paper is a sequel to the papers Baaz and Iemhoff [4] and [6] in which an alternative skolemization method called eskolemization was introduced that, when restricted to strong existential quantifiers, is sound and complete for constructive theories. In this paper we extend the method to universal quantifiers and show that for theories satisfying the witness property it is sound and complete for all formulas. We obtain a Herbrand theorem from this, and apply the method to the intuitionistic theory (...) of equality and the intuitionistic theory of monadic predicates. (shrink)

It is a received view of the post-Fregean predicate logic that a universal statement has no existential import and thus does not entail its particular (existential) counterpart. This paper takes issue with the view by discussing the trespasser case, which has widely been employed for supporting the view. The trespasser case in fact involves a shift of context. Properly understood, the case provides no support for the received view but rather suggests that we rethink the ‘quantity view’ of (...) the existential import of quantifiers. (shrink)