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

The initial goal of the present paper is to reveal a mistake committed by Hintikka in a recent paper on the foundations of mathematics. His claim that independence-friendly logic is the real logic of mathematics is supported in that article by an argument relying on uniformity concepts taken from real analysis. I show that the central point of his argument is a simple logical mistake. Second and more generally, I conclude, based on the previous remarks and on another standard fact (...) of IFL, that first-order logic can adequately express uniformity concepts in real analysis, whereas IFL cannot. This not only radically contradicts Hintikka’s particular claim in that article, but also undermines his whole enterprise of founding mathematics on his logic system. (shrink)

Charles Sanders Peirce was one of the United States’ most original and profound thinkers, and a prolific writer. Peirce’s game theory-based approaches to the semantics and pragmatics of signs and language, to the theory of communication, and to the evolutionary emergence of signs, provide a toolkit for contemporary scholars and philosophers. Drawing on unpublished manuscripts, the book offers a rich, fresh picture of the achievements of a remarkable man.

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

Branching quantifiers were first introduced by L. Henkin in his 1959 paper ‘Some Remarks on Infmitely Long Formulas’. By ‘branching quantifiers’ Henkin meant a new, non-linearly structured quantiiier-prefix whose discovery was triggered by the problem of interpreting infinitistic formulas of a certain form} The branching (or partially-ordered) quantifier-prefix is, however, not essentially infinitistic, and the issues it raises have largely been discussed in the literature in the context of finitistic logic, as they will be here. Our discussion transcends, however, the (...) resources of standard lst-order languages and we will consider the new form in the context of 1st-order logic with 1- and 2-place ‘Mostowskian` generalized quantifiers.2.. (shrink)

In this paper I examine a cluster of concepts relevant to the methodology of truth theories: 'informative definition', 'recursive method', 'semantic structure', 'logical form', 'compositionality', etc. The interrelations between these concepts, I will try to show, are more intricate and multi-dimensional than commonly assumed.

Following Henkin's discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or "cardinality" quantifiers, e.g., "most", "few", "finitely many", "exactly α", where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a general (...) definition of monotone-increasing (M↑) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwise's 1979 analysis of the basic case of M↑ POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional Ist-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages. (shrink)

The paper offers a new analysis of the difficulties involved in the construction of a general and substantive correspondence theory of truth and delineates a solution to these difficulties in the form of a new methodology. The central argument is inspired by Kant, and the proposed methodology is explained and justified both in general philosophical terms and by reference to a particular variant of Tarski's theory. The paper begins with general considerations on truth and correspondence and concludes with a brief (...) outlook on the "family" of theories of truth generated by the new methodology. (shrink)

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

Several authors proposed to devise logical structures for Natural Language (NL) semantics in which noun phrases yield referential terms rather than standard Generalized Quantifiers. In this view, two main problems arise: the need to refer to the maximal sets of entities involved in the predications and the need to cope with Independent Set (IS) readings, where two or more sets of entities are introduced in parallel. The article illustrates these problems and their consequences, then presents an extension of the proposal (...) made in Sher (J Philos Logic 26:1–43, 1997 ) in order to properly represent the meaning of IS readings involving NL quantifiers. The solution proposed here allows to uniformly deal with both standard linear and IS readings, regardless of their actual existence in NL or quantifiers’ monotonicity. Sentences featuring nested quantifications are particularly problematic. By avoiding parallel nested quantification in the formulae, the proper true values are achieved. (shrink)

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

By a fragment of a natural language we mean a subset of thatlanguage equipped with semantics which translate its sentences intosome formal system such as first-order logic. The familiar conceptsof satisfiability and entailment can be defined for anysuch fragment in a natural way. The question therefore arises, for anygiven fragment of a natural language, as to the computational complexityof determining satisfiability and entailment within that fragment. Wepresent a series of fragments of English for which the satisfiabilityproblem is polynomial, NP-complete, EXPTIME-complete,NEXPTIME-complete (...) and undecidable. Thus, this paper represents a casestudy in how to approach the problem of determining the logicalcomplexity of various natural language constructions. In addition, wedraw some general conclusions about the relationship between naturallanguage and formal logic. (shrink)

Controlled languages are regimented fragments of natural languagedesigned to make the processing of natural language more efficient andreliable. This paper defines a controlled language, E2V, whose principalgrammatical resources include determiners, relative clauses, reflexivesand pronouns. We provide a formal syntax and semantics for E2V, in whichanaphoric ambiguities are resolved in a linguistically natural way. Weshow that the expressive power of E2V is equal to that of thetwo-variable fragment of first-order logic. It follows that the problemof determining the satisfiability of a set (...) of E2V sentences is NEXPTIMEcomplete. We show that E2V can be extended in various ways withoutcompromising these complexity results; however, relaxing our policy onanaphora resolution renders the satisfiability problem for E2Vundecidable. Finally, we argue that our results have a bearing on thebroader philosophical issue of the relationship between natural andformal languages. (shrink)

This paper is truly a joint effort and it could not have been written without the contribution of both authors. Garson, though, deserves credit (or blame) for first seeing the need for two kinds of quantifier scope, and also for devising essentials of the positive theory.

The theory of existential graphs, which Peirce ultimately divided into four quadrants , is a rich method of analysis in the philosophy of logic. Its $$\upbeta $$ β -part boasts a diagrammatic theory of quantification, which by 1902 Peirce had used in the logical analysis of natural-language expressions such as complex donkey-type anaphora, quantificational patterns describing new mathematical concepts, and cognitive information processing. In the $$\upbeta $$ β -quadrant, he came close to inventing independence-friendly logic, the idea of which he (...) found indispensable in fulfilling the tasks –. (shrink)

Recent work on the acquisition of number words has emphasized the importance of integrating linguistic and developmental perspectives [Musolino, J. (2004). The semantics and acquisition of number words: Integrating linguistic and developmental perspectives. Cognition93, 1-41; Papafragou, A., Musolino, J. (2003). Scalar implicatures: Scalar implicatures: Experiments at the semantics-pragmatics interface. Cognition, 86, 253-282; Hurewitz, F., Papafragou, A., Gleitman, L., Gelman, R. (2006). Asymmetries in the acquisition of numbers and quantifiers. Language Learning and Development, 2, 76-97; Huang, Y. T., Snedeker, J., Spelke, (...) L. (submitted for publication). What exactly do numbers mean?]. Specifically, these studies have shown that data from experimental investigations of child language can be used to illuminate core theoretical issues in the semantic and pragmatic analysis of number terms. In this article, I extend this approach to the logico-syntactic properties of number words, focusing on the way numerals interact with each other (e.g. Three boys are holding two balloons) as well as with other quantified expressions (e.g. Three boys are holding each balloon). On the basis of their intuitions, linguists have claimed that such sentences give rise to at least four different interpretations, reflecting the complexity of the linguistic structure and syntactic operations involved. Using psycholinguistic experimentation with preschoolers (n=32) and adult speakers of English (n=32), I show that (a) for adults, the intuitions of linguists can be verified experimentally, (b) by the age of 5, children have knowledge of the core aspects of the logical syntax of number words, (c) in spite of this knowledge, children nevertheless differ from adults in systematic ways, (d) the differences observed between children and adults can be accounted for on the basis of an independently motivated, linguistically-based processing model [Geurts, B. (2003). Quantifying kids. Language Acquisition, 11(4), 197-218]. In doing so, this work ties together research on the acquisition of the number vocabulary with a growing body of work on the development of quantification and sentence processing abilities in young children [Geurts, 2003; Lidz, J., Musolino, J. (2002). Children's command of quantification. Cognition, 84, 113-154; Musolino, J., Lidz, J. (2003). The scope of isomorphism: Turning adults into children. Language Acquisition, 11(4), 277-291; Trueswell, J., Sekerina, I., Hilland, N., Logrip, M. (1999). The kindergarten-path effect: Studying on-line sentence processing in young children. Cognition, 73, 89-134; Noveck, I. (2001). When children are more logical than adults: Experimental investigations of scalar implicature. Cognition, 78, 165-188; Noveck, I., Guelminger, R., Georgieff, N., & Labruyere, N. (2007). What autism can tell us about every. . . not sentences. Journal of Semantics,24(1), 73-90. On a more general level, this work confirms the importance of integrating formal and developmental perspectives [Musolino, 2004], this time by highlighting the explanatory power of linguistically-based models of language acquisition and by showing that the complex structure postulated by linguists has important implications for developmental accounts of the number vocabulary. (shrink)

Truthlikeness in historiography would allow us to be optimistic fallible realists about historiography – to hold that historical knowledge is about the past, true albeit fallible, and can increase over time. In this paper, three desiderata for a concept of truthlikeness in historiography will be outlined. One of the main challenges for truthlikeness is historiographic skepticism which holds that historiography is indistinguishable from fiction and cannot therefore furnish us with true knowledge about the past. Such skepticism rests on the postmodern (...) challenge, which will be criticized on the grounds that it rests on an implausible theory of meaning. It will be shown that Peirce’s semeiotic and pragmatist theory of truth, interpreted dialogically or game-theoretically, provides a suitable framework within which to pursue the project of defining a concept of truthlikeness for historiography. Finally, directions for possible future research into truthlikeness in historiography, including ways of defining a measure of truthlikeness, will be considered. (shrink)

In this article we investigate the family of independence-friendly (IF) logics in the equality-free setting, concentrating on questions related to expressive power. Various natural equality-free fragments of logics in this family translate into existential second-order logic with prenex quantification of function symbols only and with the first-order parts of formulae equality-free. We study this fragment of existential second-order logic. Our principal technical result is that over finite models with a vocabulary consisting of unary relation symbols only, this fragment of second-order (...) logic is weaker in expressive power than first-order logic (with equality). Results about the fragment could turn out useful for example in the study of independence-friendly modal logics. In addition to proving results of a technical nature, we address issues related to a perspective from which IF logic is regarded as a specification framework for games, and also discuss the general significance of understanding fragments of second-order logic in investigations related to non-classical logics. (shrink)

In this paper it is argued that Hintikka's game theoreticalsemantics for Independence Friendly logic does not formalize theintuitions about independent choices; it rather is aformalization of imperfect information. Furthermore it is shownthat the logic has several remarkable properties (e.g.,renaming of bound variables is not allowed). An alternativesemantics is proposed which formalizes intuitions aboutindependence.

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)

In this paper we consider truth as a vague predicate and inquire into the relation between truth and definite truth. We use some tools from modal logic to clarify this distinction, as done in McGee . Finally, we consider the question whether some of the results given by McGee can be transferred to the case in which the underlying logic is stronger than first-order logic. The result will be seen to be negative.

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¹(H). At the next level, we consider an extension $L_{*}^{2}$ (H) of L¹(H) in which every sentence is an L¹(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)

Motivated by constraint satisfaction problems, Feder and Vardi (SIAM Journal of Computing, 28, 57–104, 1998) set out to search for fragments of satisfying the dichotomy property: every problem definable in is either in P or else NP-complete. Feder and Vardi considered in this connection two logics, strict NP (or SNP) and monadic, monotone, strict NP without inequalities (or MMSNP). The former consists of formulas of the form , where is a quantifier-free formula in a relational vocabulary; and the latter is (...) the fragment of SNP whose formulas involve only negative occurrences of relation symbols, only monadic second-order quantifiers, and no occurrences of the equality symbol. It remains an open problem whether MMSNP enjoys the dichotomy property. In the present paper, SNP and MMSNP are characterized in terms of partially ordered connectives. More specifically, SNP is characterized using the logic D of partially ordered connectives introduced in Blass and Gurevich (Annals of Pure and Applied Logic, 32, 1–16, 1986), Sandu and Väänänen (Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 38, 361–372 1992), and MMSNP employing a generalization C of D introduced in the present paper. (shrink)

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

We present a compositional semantics for first-order logic with imperfect information that is equivalent to Sevenster and Sandu’s equilibrium semantics (under which the truth value of a sentence in a finite model is equal to the minimax value of its semantic game). Our semantics is a generalization of an earlier semantics developed by the first author that was based on behavioral strategies, rather than mixed strategies.

We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. This atom is in fact definably equivalent (...) to the independence atom recently introduced by Väänänen and Grädel. (shrink)

Jaakko Hintikka has argued that ordinary first-order logic should be replaced byindependence-friendly first-order logic, where essentially branching quantificationcan be represented. One recurring criticism of Hintikka has been that Hintikka'ssupposedly new logic is equivalent to a system of second-order logic, and henceis neither novel nor first-order. A standard reply to this criticism by Hintikka andhis defenders has been to show that given game-theoretic semantics, Hintikka'sbranching quantifiers receive the exact same treatment as the regular first-orderones. We develop a different reply, based around (...) considerations concerning thenature of logic. In particular, we argue that Hintikka's logic is the logic that bestrepresents the language fragment standard first-order logic is meantto represent. Therefore it earns its keep, and is also properly regarded as first-order. (shrink)

The Bounds of Logic presents a new philosophical theory of the scope and nature of logic based on critical analysis of the principles underlying modern Tarskian logic and inspired by mathematical and linguistic development. Extracting central philosophical ideas from Tarski’s early work in semantics, Sher questions whether these are fully realized by the standard first-order system. The answer lays the foundation for a new, broader conception of logic. By generally characterizing logical terms, Sher establishes a fundamental result in semantics. Her (...) development of the notion of logicality for quantifiers and her work on branching are of great importance for linguistics. Sher outlines the boundaries of the new logic and points out some of the philosophical ramifications of the new view of logic for such issues as the logicist thesis, ontological commitment, the role of mathematics in logic, and the metaphysical underpinning of logic. She proposes a constructive definition of logical terms, reexamines and extends the notion of branching quantification, and discusses various linguistic issues and applications. (shrink)

Online collection of papers by Devitt, Dretske, Guarino, Hochberg, Jackson, Petitot, Searle, Tye, Varzi and other leading thinkers on philosophy and the foundations of cognitive Science. Topics dealt with include: Wittgenstein and Cognitive Science, Content and Object, Logic and Foundations, Language and Linguistics, and Ontology and Mereology.

This chapter offers a logical, linguistic, and philosophical account of modern quantification theory. Contrasting the standard approach to quantifiers (according to which logical quantifiers are defined by enumeration) with the generalized approach (according to which quantifiers are defined systematically), the chapter begins with a brief history of standard quantifier theory and identifies some of its logical, linguistic, and philosophical strengths and weaknesses. It then proceeds to a brief history of generalized quantifier theory and explains how it overcomes the weaknesses of (...) the standard theory. One of the main philosophical advantages of the generalized theory is its philosophically informative criterion of logicality. The chapter describes the work done so far in this theory, highlights some of its central logical results, offers an overview of its main linguistic contributions, and discusses its philosophical significance. (shrink)

The examination of quantifiers plays an essential role in modern linguistic theories. One of the most important issues in this respect was raised by Jaakko Hintikka, who proposed the following thesis: Certain natural language sentences require essential non-linear quantification to adequately express their logical form.