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 hexagon of opposition is an improvement of the square of opposition due to Robert Blanché. After a short presentation of the square and its various interpretations, we discuss two important problems related with the square: the problem of the I-corner and the problem of the O-corner. The meaning of the notion described by the I-corner does not correspond to the name used for it. In the case of the O-corner, the problem is not a wrong-name problem but a no-name (...) problem and it is not clear what is the intuitive notion corresponding to it. We explain then that the triangle of contrariety proposed by different people such as Vasiliev and Jespersen solves these problems, but that we don’t need to reject the square. It can be reconstructed from this triangle of contrariety, by considering a dual triangle of subcontrariety. This is the main idea of Blanché’s hexagon. We then give different examples of hexagons to show how this framework can be useful to conceptual analysis in many different fields such as economy, music, semiotics, identity theory, philosophy, metalogic and the metatheory of the hexagon itself. We finish by discussing the abstract structure of the hexagon and by showing how we can swing from sense to non-sense thinking with the hexagon. (shrink)

(First paragraph.) Different views on the relation between phenomenal reality, the world as we consciously experience it, and noumenal reality, the world as it is independent from an experiencing subject, have different implications for a collection of interrelated issues of meaning and reality including aspects of metaphysics, the philosophy of language, and philosophical methodology. Exploring some of these implications, this paper compares and brings together analytic, continental, and Buddhist approaches, focusing on relevant aspects of the philosophy of Donald Davidson, Jacques (...) Derrida, Dharmakīrti, and Dōgen. Prima facie, these philosophers have little in common, and indeed the differences are vast. Even in case of the two Western thinkers there is a fundamental difference between Davidson’s anti-dualist identification of phenomenal, experienced reality with the noumenal, real, external world on the one hand, and the bracketing or elimination of noumenal reality at the base of Derrida’s thought on the other, which lead to radically different ideas with regards to (the possibility and nature of) objectivity and our linguistic access to the real/external/noumenal world. Nevertheless, there are important similarities between Dharmakīrti’s theory of apoha and Davidson’s and Derrida’s theories of triangulation and différance respectively, and these similarities can be exploited to bridge some of the differences and attempt a constructive engagement. (shrink)

I argue that we can and should extend Tarski's model-theoretic criterion of logicality to cover indefinite expressions like Hilbert's ɛ operator, Russell's indefinite description operator η, and abstraction operators like 'the number of'. I draw on this extension to discuss the logical status of both abstraction operators and abstraction principles.

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)

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)

Timothy Williamson has argued that in the debate on modal ontology, the familiar distinction between actualism and possibilism should be replaced by a distinction between positions he calls contingentism and necessitism. He has also argued in favor of necessitism, using results on quantified modal logic with plurally interpreted second-order quantifiers showing that necessitists can draw distinctions contingentists cannot draw. Some of these results are similar to well-known results on the relative expressivity of quantified modal logics with so-called inner and outer (...) quantifiers. The present paper deals with these issues in the context of quantified modal logics with generalized quantifiers. Its main aim is to establish two results for such a logic: Firstly, contingentists can draw the distinctions necessitists can draw if and only if the logic with inner quantifiers is at least as expressive as the logic with outer quantifiers, and necessitists can draw the distinctions contingentists can draw if and only if the logic with outer quantifiers is at least as expressive as the logic with inner quantifiers. Secondly, the former two items are the case if and only if all of the generalized quantifiers are first-order definable, and the latter two items are the case if and only if first-order logic with these generalized quantifiers relativizes. (shrink)

✤ It is the characterization of those forms of reasoning that lead invariably from true sentences to true sentences, independently of the subject matter.

This paper is a brief history of natural logic at the interface of logic, linguistics, and nowadays also other disciplines. It merely summarizes some facts that deserve to be common knowledge.

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)

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)

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)

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)

One of the great successes of the application of generalized quantifiers to natural language has been the ability to formulate robust semantic universals. When such a universal is attested, the question arises as to the source of the universal. In this paper, we explore the hypothesis that many semantic universals arise because expressions satisfying the universal are easier to learn than those that do not. While the idea that learnability explains universals is not new, explicit accounts of learning that can (...) make good on this hypothesis are few and far between. We propose a model of learning — back-propagation through a recurrent neural network — which can make good on this promise. In particular, we discuss the universals of monotonicity, quantity, and conservativity and perform computational experiments of training such a network to learn to verify quantifiers. Our results are able to explain monotonicity and quantity quite well. We suggest that conservativity may have a different source than the other universals. (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)

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)

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)

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...

Aristotle draws what are, by our lights, two unusual relationships between predication and existence. First, true universal affirmations carry existential import. If ‘All humans are mortal’ is true, for example, then at least one human exists. And secondly, although affirmations with empty terms in subject position are all false, empty negations are all true: if ‘Socrates’ lacks a referent, then both ‘Socrates is well’ and ‘Socrates is ill’ are false but both ‘Socrates is not well’ and ‘Socrates is not ill’ (...) are true. In this paper, I conjecture that for Aristotle predications have mereological truth conditions: for example, ‘Socrates is pale’ is true just in case Socrates is a part of the mereological sum of pale things. The existential import of universal affirmations and the semantic profile of empty negations follow from this mereological semantics. (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)

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)

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)

This paper deals with the question of what it is for a quantifier expression to be vague. First it draws a distinction between two senses in which quantifier expressions may be said to be vague, and provides an account of the distinction which rests on independently grounded assumptions. Then it suggests that, if some further assumptions are granted, the difference between the two senses considered can be represented at the formal level. Finally, it outlines some implications of the account provided (...) which bear on three debated issues concerning quantification. (shrink)

The paper argues that two distinct and independent notions of plurality are involved in natural language anaphora and quantification: plural reference (the usual non-atomic individuals) and plural discourse reference, i.e., reference to a quantificational dependency between sets of objects (e.g., atomic/non-atomic individuals) that is established and subsequently elaborated upon in discourse. Following van den Berg (PhD dissertation, University of Amsterdam, 1996), plural discourse reference is modeled as plural information states (i.e., as sets of variable assignments) in a new dynamic system (...) couched in classical type logic that extends Compositional DRT (Muskens, Linguistics and Philosophy, 19, 143-186, 1996). Given the underlying type logic, compositionality at sub-clausal level follows automatically and standard techniques from Montague semantics become available. The idea that plural info states are semantically necessary (in addition to non-atomic individuals) is motivated by relative-clause donkey sentences with multiple instances of singular donkey anaphora that have mixed (weak and strong) readings. At the same time, allowing for non-atomic individuals in addition to plural info states enables us to capture the intuitive parallels between singular and plural (donkey) anaphora, while deriving the incompatibility between singular (donkey) anaphora and collective predicates. The system also accounts for empirically unrelated phenomena, e.g., the uniqueness effects associated with singular (donkey) anaphora discussed in Kadmon (Linguistics and Philosophy, 13, 273-324, 1990) and Heim (Linguistics and Philosophy, 13, 131-177, 1990) among others. (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.

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)

In this paper I propose a set-theoretical interpretation of the logical square of opposition, in the perspective opened by generalized quantifier theory. Generalized quantifiers allow us to account for the semantics of quantificational Noun Phrases, and of other natural language expressions, in a coherent and uniform way. I suggest that in the analysis of the meaning of Noun Phrases and Determiners the square of opposition may help representing some semantic features responsible to different logical properties of these expressions. I will (...) conclude with some consideration on scope interactions between quantifiers. (shrink)

Ordinary Language Philosophy has largely fallen out of favour, and with it the belief in the primary importance of analyses of ordinary language for philosophical purposes. Still, in their various endeavours, philosophers not only from analytic but also from other backgrounds refer to the use and meaning of terms of interest in ordinary parlance. In doing so, they most commonly appeal to their own linguistic intuitions. Often, the appeal to individual intuitions is supplemented by reference to dictionaries. In recent times, (...) Internet search engine queries for expressions of interest have become quite popular. Apparently, philosophers attempt to surpass the limits of their own linguistic intuitions by appealing to experts or to factual uses of language. I argue that this attempt is commendable but that its execution is wanting. Instead of appealing to dictionaries or Internet queries, philosophers should employ computer-based linguistic corpora in order to confirm or falsify hypotheses about the factual use of language. This approach also has some advantages over methods employed by experimental philosophers. If the importance of ordinary language is stressed, the use of linguistic corpora is hardly avoidable. (shrink)

Semantic interpretations of both natural and formal languages are usually taken to involve the specification of a domain of entities with respect to which the sentences of the language are to be evaluated. A question that has received much attention of late is whether there is unrestricted quantification, quantification over a domain comprising absolutely everything there is. Is there a discourse or inquiry that has absolute generality? After framing the debate, this article provides an overview of the main arguments for (...) and against the possibility of unrestricted quantification, highlighting some of the broader implications of the debate. (shrink)

I argue that the ‘aoristic’ operators, which are intended to describe the logic of vagueness, do not form a standard modal logic. I redefine the operators so that they do form a standard modal logic, provide a semantics of that logic, and argue that the logic is not as strong as standardly claimed.

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)

Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics. In this contribution we will compare these two logics by investigating their application in a compositional analysis of the de (...) dicto - de re ambiguity in natural language. It will be argued that Independence Friendly logic is suitable, whereas Dependence Logic is not. (shrink)

The standard semantic definition of consequence with respect to a selected set X of symbols, in terms of truth preservation under replacement (Bolzano) or reinterpretation (Tarski) of symbols outside X, yields a function mapping X to a consequence relation ⇒x. We investigate a function going in the other direction, thus extracting the constants of a given consequence relation, and we show that this function (a) retrieves the usual logical constants from the usual logical consequence relations, and (b) is an inverse (...) to—more precisely, forms a Galois connection with—the Bolzano-Tarski function. (shrink)

I show that the contemporary dominant analysis of natural language quantifiers that are one-place determiners by means of binary generalized quantifiers has failed to explain why they are, according to it, conservative. I then present an alternative, Geachean analysis, according to which common nouns in the grammatical subject position are plural logical subject-terms, and show how it does explain that fact and other features of natural language quantification.

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)

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.

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)

This paper discusses two ways of negating DP quantifier phrases. In one way, NEG modifies the quantifier D directly with the structure [[NEG D] NP]. In the other way, NEG modifies the whole DP with the structure [NEG DP]. I give evidence based on negative polarity items that negated universal quantifier phrases like not every student involve outer negation.

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)

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.

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.

In recent years, a number of new trends have seen light at the intersection of semantics and philosophy of language. They are meant to address puzzles raised by the context-sensitivity of a variety of natural language constructions, such as knowledge ascriptions, belief reports, epistemic modals, indicative conditionals, quantifier phrases, gradable adjectives, temporal constructions, vague predicates, moral predicates, predicates of personal taste. A diversity of labels have consequently emerged, such as 'contextualism', 'indexicalism', 'invariantism', 'literalism', 'minimalism', and 'relativism', variously qualified. The goal (...) of this essay is to pinpoint the issues that lie at the heart of the recent debates, clarify what is at stake, and provide a snapshot of the current theoretical landscape. (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)

Duality in Logic and Language [draft--do not cite this article] Duality phenomena occur in nearly all mathematically formalized disciplines, such as algebra, geometry, logic and natural language semantics. However, many of these disciplines use the term ‘duality’ in vastly different senses, and while some of these senses are intimately connected to each other, others seem to be entirely … Continue reading Duality in Logic and Language →.

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)