I attempt an explication of what it means for an operation across domains to be the same on all domains, an issue that ) took to be central for a successful delimitation of the logical operations. Some properties that seem strongly related to sameness are examined, notably isomorphism invariance, and sameness under extensions of the domain. The conclusion is that although no precise criterion can satisfy all intuitions about sameness, combining the two properties just mentioned yields a reasonably robust and (...) useful explication of sameness across domains. (shrink)

What is the relationship between syntax and logic? Is the former autonomous and independent of the latter? If it is not, what kind of logic syntax interfaces with? These questions are not unheard of, having been around for quite some time, along with different answers. In the generative tradition, for example, logic cannot provide a model for linguistic behaviour. Conversely, according to the logicality of language hypothesis logical considerations are relevant to syntactic formation and explain the ungrammaticality of certain constructions. (...) This note offers a brief overview of the logicality of language hypothesis and proposes new evidence that seems to indicate that accepting the said hypothesis does not necessarily require assuming a “natural” logic. (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.

Generalized quantifiers are functions from pairs of properties to truth-values; these functions can be used to interpret natural language quantifiers. The space of such functions is vast and a great deal of research has sought to find natural constraints on the functions that interpret determiners and create quantifiers. These constraints have demonstrated that quantifiers rest on number and number sense. In the first part of the paper, we turn to developing this argument. In the remainder, we report on work in (...) neurobiology that test the empirical claims of the theory. In particular, we look at fMRI experiments and behavioral experiments with various patient populations that support the intimate connection between natural language quantification and number sense. (shrink)

We present a Revised Projectivity Calculus that extends the scope of inclusion and exclusion inferences derivable under the Projectivity Calculus developed by Icard :705–725, 2012). After pointing out the inadequacies of C, we introduce four opposition properties which have been studied by Chow Proceedings of the 18th Amsterdam Colloquium, Springer, Berlin, 2012; Beziau, Georgiorgakis New dimensions of the square of opposition, Philosophia Verlag GmbH, München, 2017) and are more appropriate for the study of exclusion reasoning. Together with the monotonicity properties, (...) the OPs will form the basis of RC instead of the additive/multiplicative properties used in C. We also prove some important results of the OPs and their relation with the MPs. We then introduce a set of projectivity signatures together with the associated operations and conditions for valid inferences, and develop RC by inheriting the key features of C. We then show that under RC, we can derive some inferences that are not derivable under C. We finally discuss some properties of RC and point to possible directions of further studies. (shrink)

In this article, we describe and attempt to solve a puzzle arising from the interpretation of modified numerals like less than five and between two and five. The puzzle is this: such modified numerals seem to mean different things depending on whether they combine with distributive or non-distributive predicates. When they combine with distributive predicates, they intuitively impose a kind of upper bound, whereas when they combine with non-distributive predicates, they do not. We propose and explore in detail four solutions (...) to this puzzle, each involving some notion of maximality, but differing in the type of maximality involved and in the source of maximality. While the full range of data we consider do not conclusively favor one theory over the other three, we do argue that overall the evidence goes against the view that modified numerals lexically encode a ‘standard’ maximality operator, and suggests the need for a pragmatic blocking mechanism that filters out readings of sentences that are generated by the grammar but intuitively unavailable. (shrink)

ABSTRACT George Gargov was an active pioneer in the ‘Sofia School’ of modal logicians. Starting in the 1970s, he and his colleagues expanded the scope of the subject by introducing new modal expressive power, of various innovative kinds. The aim of this paper is to show some general patterns behind such extensions, and review some very general results that we know by now, 20 years later. We concentrate on simulation invariance, decidability, and correspondence. What seems clear is that ‘modal logic’ (...) as a genre of logical systems has a much wider scope than originally conceived, and that we have not reached its limits yet. (shrink)

The formalisation of Natural Language arguments in a formal language close to it in syntax has been a central aim of Moss’s Natural Logic. I examine how the Quantified Argument Calculus (Quarc) can handle the inferences Moss has considered. I show that they can be incorporated in existing versions of Quarc or in straightforward extensions of it, all within sound and complete systems. Moreover, Quarc is closer in some respects to Natural Language than are Moss’s systems – for instance, is (...) does not use negative nouns. The process also sheds light on formal properties and presuppositions of some inferences it formalises. Directions for future work are outlined. (shrink)

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)

We give a condensed survey of recent research on generalized quantifiers in logic, linguistics and computer science, under the following headings: Logical definability and expressive power, Polyadic quantifiers and linguistic definability, Weak semantics and axiomatizability, Computational semantics, Quantifiers in dynamic settings, Quantifiers and modal logic, Proof theory of generalized quantifiers.

Ways of Scope Taking is concerned with syntactic, semantic and computational aspects of scope. Its starting point is the well-known but often neglected fact that different types of quantifiers interact differently with each other and other operators. The theoretical examination of significant bodies of data, both old and novel, leads to two central claims. (1) Scope is a by-product of a set of distinct Logical Form processes; each quantifier participates in those that suit its particular features. (2) Scope interaction is (...) further constrained by the semantics of the interacting operators. The arguments are developed using Minimalist syntax, Generalized Quantify theory, Discourse Representation Theory, and algebraic semantics. The contributors (Beghelli, Ben-Shalom, Doetjes, Farkas, Gutiérrez Rexach, Honcoop, Stabler, Stowell, Szabolcsi and Zwarts) make tightly related theoretical assumptions and focus on related empirical phenomena, which include the direct and inverse scope of quantifiers, distributivity, negation, modal and intensional contexts, weak islands, event-related readings, interrogatives, wh/quantifier interactions, and Hungarian syntax. An introduction to the formal semantics background is provided. Audience: Linguists, philosophers, computational and psycholinguists; advanced undergraduates, graduate students and researchers in these fields. (shrink)

In this paper I focus on a recently discussed phenomenon illustrated by sentences containing predicates of taste: the phenomenon of " perspectival plurality " , whereby sentences containing two or more predicates of taste have readings according to which each predicate pertains to a different perspective. This phenomenon has been shown to be problematic for (at least certain versions of) relativism. My main aim is to further the discussion by showing that the phenomenon extends to other perspectival expressions than predicates (...) of taste and by proposing a general solution to the problem raised by it on behalf of the relativist. The core claim of the solution (" multiple indexing ") is that utterances of sentences containing perspectival expressions should be evaluated with respect to (possibly infinite) sequences of perspective parameters. (shrink)

We overview logical and computational explanations of the notion of tractability as applied in cognitive science. We start by introducing the basics of mathematical theories of complexity: computability theory, computational complexity theory, and descriptive complexity theory. Computational philosophy of mind often identifies mental algorithms with computable functions. However, with the development of programming practice it has become apparent that for some computable problems finding effective algorithms is hardly possible. Some problems need too much computational resource, e.g., time or memory, to (...) be practically computable. Computational complexity theory is concerned with the amount of resources required for the execution of algorithms and, hence, the inherent difficulty of computational problems. An important goal of computational complexity theory is to categorize computational problems via complexity classes, and in particular, to identify efficiently solvable problems and draw a line between tractability and intractability. -/- We survey how complexity can be used to study computational plausibility of cognitive theories. We especially emphasize methodological and mathematical assumptions behind applying complexity theory in cognitive science. We pay special attention to the examples of applying logical and computational complexity toolbox in different domains of cognitive science. We focus mostly on theoretical and experimental research in psycholinguistics and social cognition. (shrink)

The present volume contains a collection of papers presented at the 21st annual meeting “Sinn und Bedeutung” of the Gesellschaft fur Semantik, which was held at the University of Edinburgh on September 4th–6th, 2016. The Sinn und Bedeutung conferences are one of the leading international venues for research in formal semantics.

The article studies two related issues. First, it introduces the notion of the contraposition of quantifiers which is a “dual” notion of symmetry and has similar relations to co-intersectivity as symmetry has to intersectivity. Second, it shows how symmetry and contraposition can be generalised to higher order type quantifiers, while preserving their relations with other notions from generalized quantifiers theory.

The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most being: the compatibility of language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory T of any categorial language L generated by the so-called classical (...) categorial grammar, and also on the ground of its extension to the bi-level, intensional and extensional semantic-pragmatic theory ST for L. In T, according to the token-type distinction of Ch.S. Peirce, L is characterized first as a language of well-formed expression-tokens (wfe-tokens) - material, concrete objects - and then as a language of wfe-types - abstract objects, classes of wfe-tokens. In ST the semantic-pragmatic notions of meaning and interpretation for wfe-types of L of intensional semantics and the notion of denotation of extensional semanics for wfe-types and constituents of knowledge are formalized. These notions allow formulating a postulate (an axiom of categorial adequacy) from which follow all the most important conditions of the language adequacy, including the above, and a structural one connected with three principles of compositionality. (shrink)

The received wisdom on ability modals is that they differ from their epistemic and deontic cousins in what inferences they license and better receive a universal or conditional analysis instead of an existential one. The goal of this paper is to sharpen the empirical picture about the semantics of ability modals, and to propose an analysis that explains what makes the can of ability so special but that also preserves the crucial idea that all uses of can share a common (...) lexical semantics. The resulting framework combines tools and techniques from dynamic and inquisitive semantics with insights from the literature of the role of agency in deontic logic. It explains not only why the can of ability, while essentially being an existential modal operator, sometimes resists distribution over disjunction and interacts with its duals in particular and hitherto unnoticed ways, but also has a tendency to license free choice inferences. (shrink)

Epistemic modals are a prominent topic in the literature on natural language semantics, with wide-ranging implications for issues in philosophy of language and philosophical logic. Considerations about the role that epistemic "might" and "must" play in discourse and reasoning have led to the development of several important alternatives to classical possible worlds semantics for natural language modal expressions. This is an opinionated overview of what I take to be some of the most exciting issues and developments in the field.

We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties - here called CE quantifiers - one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further identify (...) a stronger form of monotonicity, called smoothness, which also has linguistic relevance, and we extend our considerations to smooth quantifiers. The results lead us to propose two tentative universals concerning monotonicity and natural language quantification. The notions involved as well as our proofs are presented using a graphical representation of quantifiers in the so-called number triangle. (shrink)

This light piece reflects on analogies between two often disjoint streams of research: the logical semantics and pragmatics of natural language and dynamic logics of general information-driven agency. The two areas show significant overlap in themes and tools, and yet, the focus seems subtly different in each, defying a simple comparison. We discuss some unusual questions that emerge when the two are put side by side, without any pretense at covering the whole literature or at reaching definitive conclusions.

This paper is concerned with De Morgan’s explanation of the validity of arguments that involve relational notions. It discusses De Morgan’s expansion of traditional logic aimed at accommodating those inferences, and makes the point that his endeavour is not successful in that the rules that made up his new logic are not sound. Nevertheless, the most important scholarly work on De Morgan’s logic, and contrary to that De Morgan’s mistake is not beyond repair. The rules that determine his new logic (...) are in fact monotonie replacement rules. And provided they are restricted in the correct way, these rules are demonstrably sound. (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)

A special kind of substitution on languages called iteration is presented and studied. These languages arise in the application of semantic automata to iterations of generalized quantifiers. We show that each of the star-free, regular, and deterministic context-free languages are closed under iteration and that it is decidable whether a given regular or determinstic context-free language is an iteration of two such languages. This result can be read as saying that the van Benthem/Keenan ‘Frege Boundary’ is decidable for large subclasses (...) of natural language quantifiers. We also determine the state complexity of iteration of regular languages. (shrink)

The semantic automata framework, developed originally in the 1980s, provides computational interpretations of generalized quantifiers. While recent experimental results have associated structural features of these automata with neuroanatomical demands in processing sentences with quantifiers, the theoretical framework has remained largely unexplored. In this paper, after presenting some classic results on semantic automata in a modern style, we present the first application of semantic automata to polyadic quantification, exhibiting automata for iterated quantifiers. We also discuss the role of semantic automata in (...) linguistic theory and offer new empirical predictions for sentence processing with embedded quantifiers. (shrink)

A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in the study (...) of conditionals, broader themes in the philosophy of language and formal semantics are also engaged here. This new analysis exploits a dynamic conception of meaning where the meaning of a symbol is its potential to change an agent’s mental state (or the state of a conversation) rather than being the symbol’s content (e.g. the proposition it expresses). The analysis of conditionals is also built on the idea that the contrast between subjunctive and indicative conditionals parallels a contrast between revising and consistently extending some body of information. (shrink)

The computation of scalar implicatures is sometimes costly relative to basic meanings. Among the costly computations are those that involve strengthening `some' to `not all' and strengthening inclusive disjunction to exclusive disjunction. The opposite is true for some other cases of strengthening, where the strengthened meaning is less costly than its corresponding basic meaning. These include conjunctive strengthenings of disjunctive sentences (e.g., free-choice inferences) and exactly-readings of numerals. Assuming that these are indeed all instances of strengthening via implicature/exhaustification, the puzzle (...) is to explain why strengthening sometimes increases costs while at other times it decreases costs. I develop a theory of processing costs that makes no reference to the strengthening mechanism or to other aspects of the derivation of the sentence's form/meaning. Instead, costs are determined by domain-general considerations of the grammar's output, and in particular by aspects of the meanings of ambiguous sentences and particular ways they update the context. Specifically, I propose that when the hearer has to disambiguate between a sentence's basic and strengthened meaning, the processing cost of any particular choice is a function of (i) a measure of the semantic complexity of the chosen meaning and (ii) a measure of how much relevant uncertainty it leaves behind in the context. I measure semantic complexity with Boolean Complexity in the propositional case and with semantic automata in the quantificational case, both of which give a domain-general measure of the minimal representational complexity needed to express the given meaning. I measure relevant uncertainty with the information-theoretic notion of entropy; this domain-general measure formalizes how `far' the meaning is from giving a complete answer to the question under discussion, and hence gives an indication of how much representational complexity is yet to come. Processing costs thus follow from domain-general considerations of current and anticipated representational complexity. The results might also speak to functional motivations for having strengthening mechanisms in the first place. Specifically, exhaustification allows language users to use simpler forms than would be available without it to both resolve relevant uncertainties and convey complex meanings. (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)

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)

Although it was traditionally thought that self-reference is a crucial ingredient of semantic paradoxes, Yablo (1993, 2004) showed that this was not so by displaying an infinite series of sentences none of which is self-referential but which, taken together, are paradoxical. Yablo's paradox consists of a countable series of linearly ordered sentences s(0), s(1), s(2),... , where each s(i) says: For each k > i, s(k) is false (or equivalently: For no k > i is s(k) true). We generalize Yablo's (...) results along two dimensions. First, we study the behavior of generalized Yablo-series in which each sentence s(i) has the form: For Q k > i, s(k) is true, where Q is a generalized quantifier (e.g., no, every, infinitely many, etc). We show that under broad conditions all the sentences in the series must have the same truth value, and we derive a characterization of those values of Q for which the series is paradoxical. Second, we show that in the Strong Kleene trivalent logic Yablo's results are a special case of a more general fact: under certain conditions, any semantic phenomenon that involves self-reference can be emulated without self-reference. Various translation procedures that eliminate self-reference from a non-quantificational language are defined and characterized. An Appendix sketches an extension to quantificational languages, as well as a new argument that Yablo's paradox and the translations we offer do not involve self-reference. (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)

Heim 1983 suggested that the analysis of presupposition projection requires that the classical notion of meanings as truth conditions be replaced with a dynamic notion of meanings as Context Change Potentials. But as several researchers (including Heim herself) later noted, the dynamic framework is insufficiently predictive: although it allows one to state that, say, the dynamic effect of F and G is to first update a Context Set C with F and then with G (i.e., C[F and G] = C[F][G]), (...) it fails to explain why there couldn’t be a ‘deviant’ conjunction and* which performed these operations in the opposite order (i.e., C[F and* G] = C[G][F]). We provide a formal introduction to a competing framework, the Transparency theory, which addresses this problem. Unlike dynamic semantics, our analysis is fully classical, i.e., bivalent and static. And it derives the projective behavior of connectives from their bivalent meaning and their syntax. We concentrate on the formal properties of a simple version of the theory, and we prove that (i) full equivalence with Heim’s results is guaranteed in the propositional case (Theorem 1), and that (ii) the equivalence can be extended to the quantificational case (for any generalized quantifiers), but only when certain conditions are met (Theorem 2). (shrink)

We distinguish three ways that a theory of linguistic meaning and communication might be considered dynamic in character. We provide some examples of systems which are dynamic in some of these senses but not others. We suggest that separating these notions can help to clarify what is at issue in particular debates about dynamic versus static approaches within natural language semantics and pragmatics.

Natural language sentences that talk about two or more sets of entities can be assigned various readings. The ones in which the sets are independent of one another are particularly challenging from the formal point of view. In this paper we will call them ‘Independent Set (IS) readings’. Cumulative and collective readings are paradigmatic examples of IS readings. Most approaches aiming at representing the meaning of IS readings implement some kind of maximality conditions on the witness sets involved. Two kinds (...) of maximization have been proposed in the literature: ‘Local’ and ‘Global’ maximization. In this paper, we present an online questionnaire whose results appear to support Local maximization. The latter seems to capture the proper interplay between the semantics and the pragmatics of multi-quantifier sentences, provided that witness sets are selected on pragmatic grounds. (shrink)

We evaluate the richness of the child’s input in semantics and its relation to the hypothesis space available to the child. Our case study is the acquisition of the universal quantifier every. We report two main findings regarding the acquisition of every on the basis of a corpus study of child-directed and child-ambient speech. Our first finding is that the input in semantics is rich enough to systematically eliminate instances of the subset problem of language acquisition: overly general hypotheses about (...) the meaning of every can violate pragmatic constraints, making such hypotheses incompatible with the child’s input. Our second finding is that the semantic input is too poor to eliminate instances of what we refer to as the superset problem, the mirror image of the subset problem. We argue that at least some overly specific hypotheses about the meaning of every are compatible with the child’s input, suggesting either that those hypotheses are not made available by UG or that non-trivial inductive biases are involved in children’s acquisition of every. (shrink)

Abstract This paper discusses the semantic theory presented in Robert Brandom’s Making It Explicit . I argue that it is best understood as a special version of dynamic semantics, so that these semantics by themselves offer an interesting theoretical alternative to more standard truth-conditional theories. This reorientation also has implications for more foundational issues. I argue that it gives us the resources for a renewed argument for the normativity of meaning. The paper ends by critically assessing the view in both (...) its development and motivations. Content Type Journal Article Pages 1-22 DOI 10.1007/s11098-011-9768-4 Authors Bernhard Nickel, Harvard University, Cambridge, MA, USA Journal Philosophical Studies Online ISSN 1573-0883 Print ISSN 0031-8116. (shrink)

We introduce a simple inference system based on two primitive relations between terms, namely, inclusion and exclusion relations. We present a normalization theorem, and then provide a characterization of the structure of normal proofs. Based on this, inferences in a syllogistic fragment of natural language are reconstructed within our system. We also show that our system can be embedded into a fragment of propositional minimal logic.

We describe the foundations and the systematization of natural logic-like monotonic inference using unscoped episodic logical forms (ULFs) that as reported by Kim et al. (Proceedings of the 1st and 2nd Workshops on Natural Logic Meets Machine Learning (NALOMA), Groningen, 2021a, b) introduced and first evaluated. In addition to providing a more detailed explanation of the theory and system, we present results from extending the inference manager to address a few of the limitations that as reported by Kim et al. (...) (Proceedings of the 1st and 2nd Workshops on Natural Logic Meets Machine Learning (NALOMA), Groningen, 2021b) naive system has. Namely, we add mechanisms to incorporate lexical information from the hypothesis (or goal) sentence, enable the inference manager to consider multiple possible scopings for a single sentence, and match against the goal using English rather than the ULF. (shrink)

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)