In Minimal Rationality, Christopher Cherniak boldly challenges the myth of Man the the Rational Animal and the central role that the "perfectly rational...

In this paper (except in Section 5) all quantifiers are assumedto be so called simple unaryquantifiers, and all models are assumedto be finite. We give a necessary and sufficientcondition for a quantifier to be definablein terms of monotone quantifiers. For amonotone quantifier we give a necessaryand sufficient condition for beingdefinable in terms of a given set of bounded monotonequantifiers. Finally, we give a necessaryand sufficient condition for a monotonequantifier to be definable in terms of agiven monotone quantifier.Our analysis shows that (...) the quantifierat least one half and its relatives behavedifferently than other monotone quantifiers. (shrink)

The recognition that human minds/brains are finite systems with limited resources for computation has led some researchers to advance theTractable Cognition thesis: Human cognitive capacities are constrained by computational tractability. This thesis, if true, serves cognitive psychology by constraining the space of computational‐level theories of cognition. To utilize this constraint, a precise and workable definition of “computational tractability” is needed. Following computer science tradition, many cognitive scientists and psychologists define computational tractability as polynomial‐time computability, leading to theP‐Cognition thesis. This article (...) explains how and why the P‐Cognition thesis may be overly restrictive, risking the exclusion of veridical computational‐level theories from scientific investigation. An argument is made to replace the P‐Cognition thesis by theFPT‐Cognition thesisas an alternative formalization of the Tractable Cognition thesis (here, FPT stands for fixed‐parameter tractable). Possible objections to the Tractable Cognition thesis, and its proposed formalization, are discussed, and existing misconceptions are clarified. (shrink)

Recent developments in the semantics of natural language seem to lead to a genuine synthesis of ideas from linguistics and logic, producing novel concepts and questions of interest to both parent disciplines. This book is a collection of essays on such new topics, which have arisen over the past few years. Taking a broad view, developments in formal semantics over the past decade can be seen as follows. At the beginning stands Montague's pioneering work, showing how a rigorous semantics can (...) be given for complete fragments of natural language by creating a suitable fit between syntactic categories and semantic types. This very enterprise already dispelled entrenched prejudices concerning the separation of linguistics and logic. Having seen the light, however, there is no reason at all to stick to the letter of Montague's proposals, which are often debatable. Subsequently, then, many improvements have been made upon virtually every aspect of the enterprise. More sophisticated grammars have been inserted (lately, lexical-functional grammar and generalized phrase structure grammar), more sensitive model structures have been developed (lately, 'partial' rather than 'total' in their com position), and even the mechanism of interpretation itself may be fine-tuned more delicately, using various forms of 'representations' mediating between linguistic items and semantic reality. In addition to all these refinements of the semantic format, descriptive coverage has extended considerably. (shrink)

We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same problem and suggest extending their experimental setting. Moreover, we give some direct empirical evidence linking computational complexity predictions with cognitive reality.<br>In the empirical study we compare time needed for understanding different types of quantifiers. We show that the computational distinction between quantifiers recognized by finite-automata and push-down automata is psychologically relevant. Our research improves upon hypothesis and (...) explanatory power of recent neuroimaging studies as well as provides<br>evidence. (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)

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)

The meaning of 'most' can be described in many ways. We offer a framework for distinguishing semantic descriptions, interpreted as psychological hypotheses that go beyond claims about sentential truth conditions, and an experiment that tells against an attractive idea: 'most' is understood in terms of one-to-one correspondence. Adults evaluated 'Most of the dots are yellow', as true or false, on many trials in which yellow dots and blue dots were displayed for 200 ms. Displays manipulated the ease of using a (...) 'one-to-one with remainder' strategy, and a strategy of using the Approximate Number System to compare of (approximations of) cardinalities. Interpreting such data requires care in thinking about how meaning is related to verification. But the results suggest that 'most' is understood in terms of cardinality comparison, even when counting is impossible. (shrink)

The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite models. Some of these results are simple reinterpretations of descriptive—feasible correspondence theorems from finite–model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven.

ABSTRACT This paper gives a survey of known results related to computational devices recognising monadic generalised quantifiers infinite models. Some of these results are simple reinterpretations of descriptive-feasible correspondence theorems from finite-model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven.

In the opening sections of this paper, we defined ambiguity in terms of distinct sentences (for a single sentence-string) with, in particular, distinct sets of truth conditions for the corresponding negative sentence-string. Lexical vagueness was defined as equivalent to disjunction, for under conditions of the negation of a sentence-string containing such an expression, all the relevant more specific interpretations of the string had also to be negated. Yet in the case of mixed quantification sentences, the strengthened, more specific, interpretations of (...) some such positive string are not all of them necessarily implied to be false if the corresponding negative sentence-string is asserted. On the contrary, as we saw in section 6, a negative sentence-string can be used to deny one of the more specific interpretations of the corresponding positive string without also denying other weaker interpretations of that same string. One might therefore argue that the only empirical evidence availble for assessing quantified sentences suggests clearly that these sentence-strings are ambiguous. Indeed logicians, many of whom restrict their attention to propositions, MUST recognise logical ambiguity at this point. For the contextualisation of the negative sentences in section 6 showed that it was possible to assert the falsity of some proposition P expressed by the sentence S while asserting a further proposition which was compatible with the truth of S. However the corresponding conclusion that such sentence-strings are sententially ambiguous is not a necessary conclusion for the linguist: for the alternative account of postulating a single semantic representation plus a set of semantic procedures is also compatible with the negation evidence. Moreover we have seen independent reasons for thinking that if sentential ambiguity is assumed to be in one-to-one correspondence with what we should now call logical ambiguity, a considerable body of generalisations is lost. For the maximal ambiguity account, it should be recalled, is committed to assigning at least thirteen distinct propositions and hence thirteen distinct sentence outputs for every sentence-string containing no more than two quantifiers, for three out of the four interpretations originally outlined in this paper can be understood with each numeral taken either in an ’exactly’ sense or in an ’at least’ sense. Moreover there is no explanation of why just these interpretations are available-they are merely an arbitrary list, no more connected than are the two interpretations of John saw her duck, with no reason to predict that the ambiguity would carry over from language to language. If then it is granted that an ambiguity account fails to capture appropriate generalisations, only two alternative accounts of mixed quantification sentence-strings remain viable-an analysis proposing an initial co-ordinate logical form like the logical form III, which is the strongest form compatible with each of the propositional interpretations of sentence-string Two examiners marked six scripts, and the radically weak form in which only existential quantification (both over sets and over members of those sets) is invoked. Since there are strong arguments to suggest that the procedures which both analyses require are semantic, there seems no reason not to adopt the radical vagueness account, with its considerably greater simplicity. (shrink)

In sentences like Every teacher laughed we think of every teacher as a unary (=type (1)) quantifier - it expresses a property of one place predicate denotations. In variable binding terms, unary quantifiers bind one variable. Two applications of unary quantifiers, as in the interpretation of No student likes every teacher, determine a binary (= type (2)) quantifier; they express properties of two place predicate denotations. In variable binding terms they bind two variables. We call a binary quantifier Fregean (or (...) reducible) 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 quantifi ers. Some are new here, others are familiar (though the proofs that they are non-Fregean are not). The main point of our empirical work is to inform us regarding the types of quantification natural language presents - in particular (van Benthem, 1989) that it goes beyond the usual (Fregean) analysis which treats it as mere iterated application of unary quantifiers. Secondarily, our results challenge linguistic approaches to "Logical Form" which constrain variable binding operators to "locally" bind just one occurrence of a variable, e.g., the Bijection Principle (BP) of Koopman and Sportiche (1983). The BP (correctly) blocks analyses like For which x, x's mother kissed x? for Who did his mother kiss? since For which x would locally bind two occurrences of x. But some of our irreducible binary quantifiers are naturally represented by operators which do locally bind two variables. This paper is organized as follows: Section 1 provides an explicit formulation of our questions of concern. Section 2 classifies the English constructions which we show to be non-Fregean. Section 3 presents the mathematical properties which test for non-Fregean quantification and applies these tests to the constructions in Section 2. Proofs of the mathema tical properties are given in the Appendix. (shrink)

This book is a relatively self-contained introduction to the subject, which includes the necessary background material, as well as numerous examples and exercises.

This book, written by one of philosophy's pre-eminent logicians, argues that many of the basic assumptions common to logic, philosophy of mathematics and metaphysics are in need of change. It is therefore a book of critical importance to logical theory. Jaakko Hintikka proposes a new basic first-order logic and uses it to explore the foundations of mathematics. This new logic enables logicians to express on the first-order level such concepts as equicardinality, infinity, and truth in the same language. The famous (...) impossibility results by Gödel and Tarski that have dominated the field for the last sixty years turn out to be much less significant than has been thought. All of ordinary mathematics can in principle be done on this first-order level, thus dispensing with the existence of sets and other higher-order entities. (shrink)

We study generalized quantifiers on finite structures.With every function : we associate a quantifier Q by letting Q x say there are at least (n) elementsx satisfying , where n is the sizeof the universe. This is the general form ofwhat is known as a monotone quantifier of type .We study so called polyadic liftsof such quantifiers. The particular lifts we considerare Ramseyfication, branching and resumption.In each case we get exact criteria fordefinability of the lift in terms of simpler quantifiers.

Abstract Proportional quantifiers have played a central role in the development of formal semantics because they set a benchmark for the expressive power needed to describe quantification in natural language (Barwise and Cooper Linguist Philos 4:159–219, 1981). The proportional quantifier most, in particular, supplied the initial motivation for adopting Generalized Quantifier Theory (GQT) because its meaning is definable as a relation between sets of individuals, which are taken to be semantic primitives in GQT. This paper proposes an alternative analysis of (...) most that does not treat it as a lexical item whose meaning is accessible without the help of compositional processes. Instead, proportional most is analyzed as the superlative of many (cf. Bresnan Linguist Inq 4(3):274–344, 1973). Two types of empirical evidence are presented in support of this view, both exploiting the fact that only a decompositional analysis of proportional quantifiers provides the means to generate different logical forms for seemingly equivalent statements of the form most A B and more than half of the A B. (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 discuss the thesis formulated by Hintikka 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.

In the study of cognitive processes, limitations on computational resources (computing time and memory space) are usually considered to be beyond the scope of a theory of competence, and to be exclusively relevant to the study of performance. Starting from considerations derived from the theory of computational complexity, in this paper I argue that there are good reasons for claiming that some aspects of resource limitations pertain to the domain of a theory of competence.

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)

This book, written by one of philosophy's pre-eminent logicians, argues that many of the basic assumptions common to logic, philosophy of mathematics and metaphysics are in need of change. It is therefore a book of critical importance to logical theory. Jaakko Hintikka proposes a new basic first-order logic and uses it to explore the foundations of mathematics. This new logic enables logicians to express on the first-order level such concepts as equicardinality, infinity, and truth in the same language. The famous (...) impossibility results by Gödel and Tarski that have dominated the field for the last sixty years turn out to be much less significant than has been thought. All of ordinary mathematics can in principle be done on this first-order level, thus dispensing with the existence of sets and other higher-order entities. (shrink)

Chapter. 1. Logical. Form. as. a. Level. of. Linguistic. Representation. What is the relation of a sentence's syntactic form to its logical form? This issue has been of central concern in modern inquiry into the semantic properties of natural ...

This volume contains a collection of research papers centered around the concept of quantifier. Recently this concept has become the central point of research in logic. It is one of the important logical concepts whose exact domain and applications have so far been insufficiently explored, especially in the area of inferential and semantic properties of languages. It should thus remain the central point of research in the future. Moreover, during the last twenty years generalized quantifiers and logical technics based on (...) them have proved their utility in various applications. The example of natu rallanguage semantics has been partcularly striking. For a long time it has been belived that elementary logic also called first-order logic was an ade quate theory of logical forms of natural language sentences. Recently it has been accepted that semantics of many natural language constructions can not be properly represented in elementary logic. It has turned out, however, that they can be described by means of generalized quantifiers. As far as computational applications oflogic are concerned, particulary interesting are semantics restricted to finite models. Under this restriction elementary logic looses several of its advantages such as axiomatizability and compactness. And for various purposes we can use equally well some semantically richer languages of which generalized quantifiers offer the most universal methods of describing extensions of elementary logic. Moreover we can look at generalized quantifiers as an explication of some specific mathematical concepts, e. g. (shrink)

Quantification is a topic which brings together linguistics, logic, and philosophy. Quantifiers are the essential tools with which, in language or logic, we refer to quantity of things or amount of stuff. In English they include such expressions as no, some, all, both, many. Peters and Westerstahl present the definitive interdisciplinary exploration of how they work - their syntax, semantics, and inferential role.

Dependence is a common phenomenon, wherever one looks: ecological systems, astronomy, human history, stock markets - but what is the logic of dependence? This book is the first to carry out a systematic logical study of this important concept, giving on the way a precise mathematical treatment of Hintikka’s independence friendly logic. Dependence logic adds the concept of dependence to first order logic. Here the syntax and semantics of dependence logic are studied, dependence logic is given an alternative game theoretic (...) semantics, and results about its complexity are proven. This is a graduate textbook suitable for a special course in logic in mathematics, philosophy and computer science departments, and contains over 200 exercises, many of which have a full solution at the end of the book. It is also accessible to readers, with a basic knowledge of logic, interested in new phenomena in logic. (shrink)

Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens / von Dr. Gottlob Frege,...Date de l'edition originale : 1879Ce livre est la reproduction fidele d'une oeuvre publiee avant 1920 et fait partie d'une collection de livres reimprimes a la demande editee par Hachette Livre, dans le cadre d'un partenariat avec la Bibliotheque nationale de France, offrant l'opportunite d'acceder a des ouvrages anciens et souvent rares issus des fonds patrimoniaux de la BnF.Les oeuvres faisant partie de cette collection ont ete numerisees (...) par la BnF et sont presentes sur Gallica, sa bibliotheque numerique.En entreprenant de redonner vie a ces ouvrages au travers d'une collection de livres reimprimes a la demande, nous leur donnons la possibilite de rencontrer un public elargi et participons a la transmission de connaissances et de savoirs parfois difficilement accessibles.Nous avons cherche a concilier la reproduction fidele d'un livre ancien a partir de sa version numerisee avec le souci d'un confort de lecture optimal. Nous esperons que les ouvrages de cette nouvelle collection vous apporteront entiere satisfaction.Pour plus d'informations, rendez-vous sur www.hachettebnf.frhttp://gallica.bnf.fr/ark:/12148/bpt6k65658c. (shrink)