This volume covers a wide range of topics in the most recent debates in the philosophy of mathematics, and is dedicated to how semantic, epistemological, ontological and logical issues interact in the attempt to give a satisfactory picture of mathematical knowledge. The essays collected here explore the semantic and epistemic problems raised by different kinds of mathematical objects, by their characterization in terms of axiomatic theories, and by the objectivity of both pure and applied mathematics. They investigate controversial aspects of (...) contemporary theories such as neo-logicist abstractionism, structuralism, or multiversism about sets, by discussing different conceptions of mathematical realism and rival relativistic views on the mathematical universe. They consider fundamental philosophical notions such as set, cardinal number, truth, ground, finiteness and infinity, examining how their informal conceptions can best be captured in formal theories. The philosophy of mathematics is an extremely lively field of inquiry, with extensive reaches in disciplines such as logic and philosophy of logic, semantics, ontology, epistemology, cognitive sciences, as well as history and philosophy of mathematics and science. By bringing together well-known scholars and younger researchers, the essays in this collection – prompted by the meetings of the Italian Network for the Philosophy of Mathematics (FilMat) – show how much valuable research is currently being pursued in this area, and how many roads ahead are still open for promising solutions to long-standing philosophical concerns. Promoted by the Italian Network for the Philosophy of Mathematics – FilMat. (shrink)

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)

In a mathematical perspective, neighborhood models for modal logic are generalized quantifiers, parametrized to points in the domain of objects/worlds. We explore this analogy further, connecting generalized quantifier theory and modal neighborhood logic. In particular, we find interesting analogies between conservativity for linguistic quantifiers and the locality of modal logic, and between the role of invariances in both fields. Moreover, we present some new completeness results for modal neighborhood logics of linguistically motivated classes of generalized quantifiers, and raise new types (...) of open problem. With the bridges established here, many further analogies might be explored between the two fields to mutual benefit. (shrink)

Is there a reason to believe that the evolution of language leads to compositional semantics? A proposal from Henry Brighton is presented and criticized. As an alternative, the role of compositionality for the complexity of semantic interpretation is emphasized.

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)

Plural expressions found in natural languages allow us to talk about many objects simultaneously. Plural logic — a logical system that takes plurals at face value — has seen a surge of interest in recent years. This book explores its broader significance for philosophy, logic, and linguistics. What can plural logic do for us? Are the bold claims made on its behalf correct? After introducing plural logic and its main applications, the book provides a systematic analysis of the relation between (...) this logic and other theoretical frameworks such as set theory, mereology, higher-order logic, and modal logic. The applications of plural logic rely on two assumptions, namely that this logic is ontologically innocent and has great expressive power. These assumptions are shown to be problematic. The result is a more nuanced picture of plural logic's applications than has been given thus far. Questions about the correct logic of plurals play a central role in the final chapters, where traditional plural logic is rejected in favor of a "critical" alternative. The most striking feature of this alternative is that there is no universal plurality. This leads to a novel approach to the relation between the many and the one. In particular, critical plural logic paves the way for an account of sets capable of solving the set-theoretic paradoxes. (shrink)

Logical form has always been a prime concern for philosophers belonging to the analytic tradition. For at least one century, the study of logical form has been widely adopted as a method of investigation, relying on its capacity to reveal the structure of thoughts or the constitution of facts. This book focuses on the very idea of logical form, which is directly relevant to any principled reflection on that method. Its central thesis is that there is no such thing as (...) a correct answer to the question of what is logical form: two significantly different notions of logical form are needed to fulfil two major theoretical roles that pertain respectively to logic and to semantics. This thesis has a negative and a positive side. The negative side is that a deeply rooted presumption about logical form turns out to be overly optimistic: there is no unique notion of logical form that can play both roles. The positive side is that the distinction between two notions of logical form, once properly spelled out, sheds light on some fundamental issues concerning the relation between logic and language. (shrink)

We provide necessary and sufficient conditions determining how monotonicity of some classes of reducible quantifiers depends on the monotonicity of simpler quantifiers of iterations to which they are equivalent.

A type quantifier F is symmetric iff F ( X, X )( Y ) = F ( Y, Y )( X ). It is shown that quantifiers denoted by irreducible binary determiners in natural languages are both conservative and symmetric and not only conservative.

The paper clarifies and defends the orthodox view that counterfactual conditionals with impossible antecedents are vacuously true against recent criticisms. It argues that apparent counterexamples to orthodoxy result from uncritical reliance on a fallible heuristic used in the processing of conditionals. A comparison is developed between such counterpossibles and vacuously true universal generalizations.

Bolzano’s definition of consequence in effect associates with each set X of symbols (in a given interpreted language) a consequence relation X . We present this in a precise and abstract form, in particular studying minimal sets of symbols generating X . Then we present a method for going in the other direction: extracting from an arbitrary consequence relation its associated set C of constants. We show that this returns the expected logical constants from familiar consequence relations, and that, restricting (...) attention to sets of symbols satisfying a strong minimality condition, there is an isomorphism between the set of strongly minimal sets of symbols and the set of corresponding consequence relations (both ordered under inclusion). (shrink)

This note explains the circumstances under which a type 1 quantifier can be decomposed into a type 1, 1 quantifier and a set, by fixing the first argument of the former to the latter. The motivation comes from the semantics of Noun Phrases (also called Determiner Phrases) in natural languages, but in this article, I focus on the logical facts. However, my examples are taken among quantifiers appearing in natural languages, and at the end, I sketch two more principled linguistic (...) applications. (shrink)

In order to uphold the claim that referential intuitions are a reliable source of evidence for theories of reference, Machery et al. conducted an empirical research by testing truth-value judgments. First, we discuss a conceptual limitation of Machery et al. ’s experiment on truth-value judgments. Then, we present the data of an empirical survey that shows that people’s truth-value judgments are not congruent with their use of proper names. We explain why the results of our empirical research refute the conclusions (...) of Machery et al. ’s experiment on truth-value judgments. We conclude that referential intuitions are still problematic. (shrink)

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)

I argue that standard definitions of quantifiers are inadequate and offer a new one. The new definition categorizes expressions as quantifiers in accordance with our pre-theoretical judgments, it is broadly applicable to both formal and natural languages, and it eschews unnecessary theoretical commitments about the details of the syntax and semantics of these expressions.

Schemat wnioskowania mou w logice mohistycznej Biorąc za punkt wyjścia monotoniczność rozumowania, artykuł przedstawia systematyczny sposób interpretacji schematu wnioskowania mou w tekstach mohistycznych. Wzięliśmy pod uwagę zarówno perspektywę logiczną. jak i lingwistyczną, zwracając szczególną uwagę na specyfikę klasycznego języka chińskiego, rolę kontekstu i uwzględniając wszelkie możliwe wskazówki pochodzące ze źródłowych tekstów. Poprzez zastosowania reguł monotoniczności sformułowaliśmy jednolitą odpowiedź na pytanie, dlaczego shi er ran są uznawane za rozumowania poprawne, a shi er buran przeciwnie — uznawane są za kontrprzykłady.

The paper suggests a modal predicate logic that deals with classical quantification and modalities as well as intermediate operators, like “most” and “mostly”. Following up the theory of generalized quantifiers, we will understand them as two-placed operators and call them determiners. Quantifiers as well as modal operators will be constructed from them. Besides the classical deduction, we discuss a weaker probabilistic inference “therefore, probably” defined by symmetrical probability measures in Carnap’s style. The given probabilistic inference relates intermediate quantification to singular (...) statements: “Most S are P” does not logically entail that a particular individual S is also P, but it follows that this is probably the case, where the probability is not ascribed to the propositions but to the inference. We show how this system deals with single case expectations while predictions of statistical statements remain generally problematic. (shrink)

In this paper, I argue that there are good motivations for a relativist account of the domain-sensitivity of quantifier phrases. I will frame the problem as a puzzle involving what looks like a logically valid inference, yet one whose premises are true while the conclusion is false. After discussing some existing accounts, literalist and contextualist, I will present and argue for an account that may be said to be relativist in the following sense: (i) a domain of quantification is required (...) for determining truth value, but is idle in determining semantic content, and (ii) the same sentence, as used on one and the same occasion, may receive different truth values relative to different domains. (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)

Generalized Quantifier Theory defines superlative quantifiers at most n and at least n as truth-conditionally equivalent to comparative quantifiers fewer than n+1 and more than n \1. It has been demonstrated, however, that this standard theory cannot account for various linguistic differences between these two types of quantifiers. In this paper I discuss how the distinction between assertibility and truth-conditions can be applied to explain this phenomenon. I draw a parallel between the assertibility of disjunctions and superlative quantifiers, and argue (...) that those assertibility conditions are essentially modal. I use epistemic logic to formalize the assertibility conditions and revisit some of the linguistic puzzles related to superlative quantification. (shrink)

Peters and Westerståhl (Quantifiers in Language and Logic, 2006), and Westerståhl (New Perspectives on the Square of Opposition, 2011) draw a crucial distinction between the “classical” Aristotelian squares of opposition and the “modern” Duality squares of opposition. The classical square involves four opposition relations, whereas the modern one only involves three of them: the two horizontal connections are fundamentally distinct in the Aristotelian case (contrariety, CR vs. subcontrariety, SCR) but express the same Duality relation of internal negation (SNEG). Furthermore, the (...) vertical relations in the classical square are unidirectional, whereas in the modern square they are bidirectional. The present paper argues that these differences become even bigger when two more operators are added, namely the U ( ${{\equiv} {\rm A}\,{\vee} \,{\rm E} }$ , all or no) and Y ( ${\equiv{\rm I} \,{\wedge} \,{\rm O}}$ , some but not all) of Blanché (Structures Intellectuelles, 1969). In the resulting Aristotelian hexagon the two extra nodes are perfectly integrated, yielding two interlocking triangles of CR and SCR. In the duality hexagon by contrast, they do not enter into any relation with the original square, but constitute a independent pair of their own, since they are their own SNEGs. Hence, they not only stand in a relation of external NEG, but also in one of duality. This reflexive nature of the SNEG will be shown to result in defective monotonicity configurations for the pair, namely the absence of right-monotonicity (on the predicate argument). In the second half of the paper, we present an overview of those hexagonal structures which are both Aristotelian and Duality configurations, and those which are only Aristotelian. (shrink)

The central aim of this paper is to present a Boolean algebraic approach to the classical Aristotelian Relations of Opposition, namely Contradiction and (Sub)contrariety, and to provide a 3D visualisation of those relations based on the geometrical properties of Platonic and Archimedean solids. In the first part we start from the standard Generalized Quantifier analysis of expressions for comparative quantification to build the Comparative Quantifier Algebra CQA. The underlying scalar structure allows us to define the Aristotelian relations in Boolean terms (...) and to propose a 3D visualisation by transforming a cube into an octahedron. In part two, the architecture of the CQA is shown to carry over, both to the classical quantifiers of Predicate Calculus and to the modal operators—which are given a Generalized Quantifier style re-interpretation. In this way we provide an algebraic foundation for Blanché’s Aristotelian hexagon as well as a 3D alternative to his 2D star-like visualisation. In a final part, a richer scalar structure is argued to underly the realm of Modality, thus generalizing the 3D algebra with eight (2 3 ) operators to a 4D algebra with sixteen (2 4 ) operators. The visual representation of the latter structure involves a transformation of the hypercube to a rhombic dodecahedron. The resulting 3D visualisation allows a straightforward embedding, not only of the classical Blanché star of Aristotelian relations or the paracomplete and paraconsistent stars of Béziau (Log Investig 10, 218–232, 2003) but also of three additional isomorphic Aristotelian constellations. (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)

We argue that a comprehensive theory of reciprocals must rely on a general taxonomy of restrictions on the interpretation of relational expressions. Developing such a taxonomy, we propose a new principle for interpreting reciprocals that relies on the interpretation of the relation in their scope. This principle, the Maximal Interpretation Hypothesis (MIH), analyzes reciprocals as partial polyadic quantifiers. According to the MIH, the partial quantifier denoted by a reciprocal requires the relational expression REL in its scope to denote a maximal (...) relation in REL’s interpretation domain. In this way the MIH avoids a priori assumptions on the available readings of reciprocal expressions, which are necessary in previous accounts. Relying extensively on the work of Dalrymple et al. (Ling Philos 21:159–210, 1998), we show that the MIH also exhibits some observational improvements over Dalrymple et al.’s Strongest Meaning Hypothesis (SMH). In addition to deriving some attested reciprocal interpretations that are not expected by the SMH, the MIH offers a more restrictive account of the way context affects the interpretation of reciprocals through its influence on relational domains. Further, the MIH generates a reciprocal interpretation at the predicate level, which is argued to be advantageous to Dalrymple et al.’s propositional selection of reciprocal meanings. More generally, we argue that by focusing on restrictions on relational domains, the MIH opens the way for a more systematic study of the ways in which lexical meaning, world knowledge and contextual information interact with the interpretation of quantificational expressions. (shrink)

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)

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)

The goal of this paper is to present a new reconstruction of Aristotle's assertoric logic as he develops it in Prior Analytics, A1-7. This reconstruction will be much closer to Aristotle's original...

Severity of Test (SoT) is an alternative to Popper's logical falsification that solves a number of problems of the logical view. It was presented by Popper himself in 1963. SoT is a less sophisticated probabilistic model of hypothesis testing than Oaksford & Chater's (O&C's) information gain model, but it has a number of striking similarities. Moreover, it captures the intuition of everyday hypothesis testing.

Russell's notion of an incomplete symbol has become a standard against which philosophers compare their views on the relationship between language and the world. But Russell's exact characterization of incomplete symbols and the role they play in his philosophy are still disputed. In this paper, I trace the development of the notion of an incomplete symbol in Russell's philosophy. I suggest – against Kaplan, Evans, and others – that Russell's many characterizations of the notion of an incomplete symbol are compatible. (...) To this end, I examine and reject arguments for the purported incompatibility between declaring an expression to be incomplete and incorporating that symbol into a compositional semantic theory. I then examine how Russell puts the notion of an incomplete symbol to use in metaphysics. (shrink)

We discuss O&C's probabilistic approach from a probability logical point of view. Specifically, we comment on subjective probability, the indispensability of logic, the Ramsey test, the consequence relation, human nonmonotonic reasoning, intervals, generalized quantifiers, and rational analysis.

This paper gives a uniform account of the meaning of generalizations with explicit exceptions that employ the prepositions “but”, “except”, and “except for”. Our theory is that exceptives depend on generalizations, which can but need not be universal, whose generality they limit, and some of whose exceptions they comment on. Every generalization intrinsically partitions its domain of applicability into regular cases, which are as it says to expect, and exceptions, which are not. A generalization’s exceptions are instances that falsify it (...) if sufficiently prevalent. These two facts underpin the meaning of exceptives as combining a _generality claim_ with an _exception claim_, giving correct truth conditions for the several ways the three exceptive prepositions are used, and significantly improving on existing semantic accounts in the literature. We support this by analyzing a wide range of examples. The analysis applies whether or not the phrase following the exceptive preposition is a DP, and whether or not the generalization is expressed with a quantifier. We further argue that these exceptive prepositions are synonymous, contrary to the widely held view that a difference in meaning explains their different syntactic distributions. (shrink)

We argue that formal linguistic theory, properly extended, can provide a unifying framework for diverse phenomena beyond traditional linguistic objects. We display applications to pictorial meanings, visual narratives, music, dance, animal communication, and, more abstractly, to logical and non-logical concepts in the ‘language of thought’ and reasoning. In many of these cases, a careful analysis reveals that classic linguistic notions are pervasive across these domains, such as for instance the constituency (or grouping) core principle of syntax, the use of logical (...) variables (for object tracking), or the variety of inference types investigated in semantics/pragmatics. The aim of this overview is to show how the application of formal linguistic concepts and methodology to non-linguistic objects yields non-trivial insights, thus opening the possibility of a general, precise theory of signs. (An appendix, found in the online supplements to this article, surveys applications of Super Linguistics to animal communication.). (shrink)

This is the second part of a two-part article on compositionality, i.e. the principle that the meaning of a complex expression is determined by the meanings of its parts and the way they are put together. In the first, Pagin and Westerståhl (2010), we provide a general historical background, a formal framework, definitions, and a survey of variants of compositionality. It will be referred to as Part I. Here we discuss arguments for and against the claim that natural languages have (...) a compositional semantics. We also discuss some problem cases, including belief reports, quotation, idioms, and ambiguity. (shrink)

Human cognition requires coping with a complex and uncertain world. This suggests that dealing with uncertainty may be the central challenge for human reasoning. In Bayesian Rationality we argue that probability theory, the calculus of uncertainty, is the right framework in which to understand everyday reasoning. We also argue that probability theory explains behavior, even on experimental tasks that have been designed to probe people's logical reasoning abilities. Most commentators agree on the centrality of uncertainty; some suggest that there is (...) a residual role for logic in understanding reasoning; and others put forward alternative formalisms for uncertain reasoning, or raise specific technical, methodological, or empirical challenges. In responding to these points, we aim to clarify the scope and limits of probability and logic in cognitive science; explore the meaning of the explanation of cognition; and re-evaluate the empirical case for Bayesian rationality. (shrink)

We consider the notion of everyday language. We claim that everyday language is semantically bounded by the properties expressible in the existential fragment of second–order logic. Two arguments for this thesis are formulated. Firstly, we show that so–called Barwise's test of negation normality works properly only when assuming our main thesis. Secondly, we discuss the argument from practical computability for finite universes. Everyday language sentences are directly or indirectly verifiable. We show that in both cases they are bounded by second–order (...) existential properties. Moreover, there are known examples of everyday language sentences which are the most difficult in this class (NPTIME–complete). (shrink)

The problem concerns quantifiers that seem to hover between universal and existential readings. I argue that they are neither, but a different quantifier that has features of each. NOTE the published paper has a mistake. I have corrected this in the version on this site. A correction note will appear in Analysis.

Natural language contains many expressions with underspecified emotive content. This paper proposes a way to resolve such underspecification. Nonmonotonic inference over a knowledge base is used to derive an expected interpretation for emotive expressions in a particular context. This ‘normal’ meaning is then taken to influence the hearer’s expectations about probable interpretations, and, because of these probable interpretations, the decisions of the speaker about when use of underspecified emotive terms is appropriate.

Natural language contains many expressions with underspecified emotive content. This paper proposes a way to resolve such underspecification. Nonmonotonic inference over a knowledge base is used to derive an expected interpretation for emotive expressions in a particular context. This ‘normal’ meaning is then taken to influence the hearer’s expectations about probable interpretations, and, because of these probable interpretations, the decisions of the speaker about when use of underspecified emotive terms is appropriate.

ABSTRACT There has been recent interest in the idea that, when metaphysicians disagree over the truth of (say) ‘There are numbers’ or ‘Chairs exist’, their dispute is merely verbal. This idea has been taken to motivate quantifier variance, the view that the meanings of quantifier expressions vary across different ontological languages, and that each of these meanings is of equal metaphysical merit. I argue that quantifier variance cannot be upheld in light of natural language theorists’ analyses of quantifier expressions. The (...) idea that metaphysicians are engaged in verbal disputes can be maintained only through alternative strategies that have nothing to do with quantifier expressions. (shrink)

When embedding data are used to argue against semantic theory A and in favor of semantic theory B, it is important to ask whether A could make sense of those data. It is possible to ask that question on a case-by-case basis. But suppose we could show that A can make sense of all the embedding data which B can possibly make sense of. This would, on the one hand, undermine arguments in favor of B over A on the basis (...) of embedding data. And, provided that the converse does not hold—that is, that A can make sense of strictly more embedding data than B can—it would also show that there is a precise sense in which B is more constrained than A, yielding a pro tanto simplicity-based consideration in favor of B. In this paper I develop tools which allow us to make comparisons of this kind, which I call comparisons of potential expressive power. I motivate the development of these tools by way of exploration of the recent debate about epistemic modals. Prominent theories which have been developed in response to embedding data turn out to be strictly less expressive than the standard relational theory, a fact which necessitates a reorientation in how to think about the choice between these theories. (shrink)

Nguyen argues that only his radically pragmatic account and Sterken’s indexical account can capture what we call the positive data. We present some new data, which we call the negative data, and argue that no theory of generics on the market is compatible with both the positive data and the negative data. We develop a novel version of the indexical account and show that it captures both the positive data and the negative data. In particular, we argue that there is (...) a semantic constraint that, in any context, the semantic value of GEN is upward monotone and non-symmetric. On the other hand, the pragmatic account has difficulty accommodating the negative data. This is because no pragmatic principles have been developed that can explain the negative data. In the paper, we focus on only the pragmatic account and the indexical account, but our discussion has broad implications for the debate on generics: any empirically adequate accounts of generics must be flexible enough to accommodate the positive data and yet constrained enough to accommodate the negative data. (shrink)

We consider collective quantification in natural language. For many years the common strategy in formalizing collective quantification has been to define the meanings of collective determiners, quantifying over collections, using certain type-shifting operations. These type-shifting operations, i.e., lifts, define the collective interpretations of determiners systematically from the standard meanings of quantifiers. All the lifts considered in the literature turn out to be definable in second-order logic. We argue that second-order definable quantifiers are probably not expressive enough to formalize all collective (...) quantification in natural language. (shrink)

Paul Horwich is aware of the fact that his theory as stated in his works is directly applicable only to a language in which a word, understood as a syntactic type, is connected with exactly one literal meaning. Yet he claims that the theory is expandable to include homonymy and indexicality and thus may be considered as applicable to natural language. My concern in this paper is with yet another kind of ambiguity—systematic polysemy—that assigns multiple meanings to one linguistic type. (...) I want to combine the characteristics of systematic polysemy with the Kaplanian insight that meanings of expressions may be defined by semantic rules which assign content in context and to ask the question if minimalism about truth and meaning is compatible with such rule-based systematic polysemy. I will first explain why the expressions that exhibit rule-based systematic polysemy are difficult to combine with a truth theory that is based on a use theory of meaning before proceeding to argue that indexicals and proper names are such expressions. (shrink)

In this paper I argue for a non-referential interpretation of some uses of indexicals embedded under epistemic modals. The so-called descriptive uses of indexicals come in several types and it is argued that those embedded within the scope of modal operators do not require non-referential interpretation, provided the modality is interpreted as epistemic. I endeavor to show that even if we allow an epistemic interpretation of modalities, the resulting interpretation will still be inadequate as long as we retain a referential (...) interpretation of indexicals. I then propose an analysis of descriptive indexicals that combines an epistemic interpretation of modality with a non-referential interpretation of indexicals. (shrink)

The objectives of this paper are twofold. The first is to present a differentiation between two kinds of deferred uses of indexicals: those in which indexical utterances express singular propositions (I term them deferred reference proper) and those where they express general propositions (called descriptive uses of indexicals). The second objective is the analysis of the descriptive uses of indexicals. In contrast to Nunberg, who treats descriptive uses as a special case of deferred reference in which a property contributes to (...) the proposition expressed, I argue that examples in which a general proposition is indeed expressed by an indexical cannot be treated by assuming that the property is a deferred referent of the pronoun. I propose an analysis of descriptive uses of indexicals by means of a pragmatic mechanism of ‘descriptive anaphora’, which attempts to explain the special kind of contribution of the property retrieved from the context to the proposition that is characteristic of the descriptive interpretation. (shrink)

Elements of Formal Semantics has already been reviewed twice :42, 2016; Erlewine in Comput Linguist 42:837–839, 2017). As well, the website for the work is accompanied by evaluative quotes by noted scholars. All are very positive concerning its clarity and its utility as an introduction to formal semantics for natural language. As I agree with these evaluations my interest in reiterating them in slightly different words is limited. So my reviews of the content chapters will be accompanied by a Reflections (...) section consisting of my own reflections on the foundations of model theoretic semantics for natural language as laid out in EFS. The issues I address—alternate ways of accomplishing the tasks Winter treats—should not be included in an introductory work but they may be helpful for those who teach classes for which EFS is an appropriate text. They might also help with queries about the content of the text by those using it. I note that a mark of a clear text is that it allows the reader to reflect on its content not its presentation. (shrink)

In this paper, we study natural language constructions which were first examined by Barwise: The richer the country, the more powerful some of its officials. Guided by Barwise’s observations, we suggest that conceivable interpretations of such constructions express the existence of various similarities between partial orders such as homomorphism or embedding. Semantically, we interpret the constructions as polyadic generalized quantifiers restricted to finite models. We extend the results obtained by Barwise by showing that similarity quantifiers are not expressible in elementary (...) logic over finite models. We also investigate whether the proposed readings are sound from the cognitive perspective. We prove that almost all similarity quantifiers are intractable. This leads us to first-order variants, which only approximate the strong readings, but are cognitively more plausible. Driven by the question of ambiguity, we recall Barwise’s argumentation in favour of strong readings, enriching it with some arguments of our own. Given that Barwise-like sentences are indeed ambiguous, we use a generalized Strong Meaning Hypothesis to derive predictions for their verification. Finally, we propose a hypothesis according to which conflicting pressures of communication and cognition might give rise to an ambiguous construction, provided that different semantic variants of the construction withstand different pressures involved in its usage. (shrink)