A historically popular response to the liar paradox (“this sentence is false”) is to say that the liar sentence is meaningless (or semantically defective, or malfunctions, or…). Unfortunately, like all other supposed solutions to the liar, this approach faces a revenge challenge. Consider the revenge liar sentence, “this sentence is either meaningless or false”. If it is true, then it is either meaningless or false, so not true. And if it is not true, then it can’t be either meaningless or (...) false, so it must be true. Either way, we are back in a paradox. This paper provides a detailed and exhaustive discussion of the options for responding to revenge on behalf of “meaningless” theories. Though I attempt to discuss all of the options fairly, I will ultimately opt for one specific response and discuss some of its challenges. Various technical and logical matters will be discussed throughout the paper, but my focus will be philosophical, throughout. My overall conclusion is that the “meaningless” strategy is at least as well off in the face of revenge as any other approach to the liar and related paradoxes. (shrink)

If we want to retain classical logic and standard syntax in light of the liar, we are forced to restrict the T-schema. The traditional philosophical justification for this is sentential – liar sentences somehow malfunction. But the standard formal way of implementing this is conditional, our T-sentences tell us that if “p” does not malfunction, then “p” is true if and only if p. Recently Bacon and others have pointed out that conditional T-restrictions like this flirt with incoherence. If we (...) want to keep the “malfunction” motivation, our only other option is to non-conditionally restrict the T-schema, but Field and others have given powerful philosophical and technical arguments against this kind of approach. Here I argue that if we really take the philosophical motivation for restricting T-sentences seriously, we can explain why conditional restrictions fail, answer Field's argument, and reason in a coherent way about truth using a non-conditional restriction strategy. This cracks the door open for a fully classical response to the liar and related paradoxes. In closing, I argue that, when properly understood, this kind of “restriction” is not really a restriction at all. If this is right, then the holy grail of liar studies (classical logic, naïve truth, and standard syntax) may yet be attainable. (Note for readers: when this paper was first put online, the typesetters had changed some instances of corners to brackets, leading to confusion. The paper has now been corrected online by PPR, so please make sure you have the corrected version before reading or citing.). (shrink)

There are two dominant approaches to quantification: the Fregean and the Tarskian. While the Tarskian approach is standard and familiar, deep conceptual objections have been pressed against its employment of variables as genuine syntactic and semantic units. Because they do not explicitly rely on variables, Fregean approaches are held to avoid these worries. The apparent result is that the Fregean can deliver something that the Tarskian is unable to, namely a compositional semantic treatment of quantification centered on truth and reference. (...) We argue that the Fregean approach faces the same choice: abandon compositionality or abandon the centrality of truth and reference to semantic theory. Indeed, we argue that developing a fully compositional semantics in the tradition of Frege leads to a typographic variant of the most radical of Tarskian views: variabilism, the view that names should be modeled as Tarskian variables. We conclude with the consequences of this result for Frege's distinction between sense and reference. (shrink)

This article examines the traditional and modern doctrines of categorical propositions and argues that both doctrines have serious problems. While the doctrines disagree about existential imports...

The need for a ‘many-valued logic’ in linguistics has been evident since the 1970s, but there was lack of clarity as to whether it should come from the family of fuzzy logics or from the family of probabilistic logics. In this regard, Fine [14] and Kamp [26] pointed out undesirable effects of fuzzy logic (the failure of idempotency and coherence) which kept two generations of linguists and philosophers at arm’s length. (Another unwanted feature of fuzzy logic is the property of (...) truth functionality.) While probabilistic logic is not fraught by the same problems, its lack of constructiveness, i.e. its inability to compose complex truth degrees from atomic truth degrees, did not make it more attractive to linguists either. In the absence of a clear perspective in ‘many-valued logic’, scholars chose to proliferate ontologies grafted atop the classical bivalent logic: ontologies for truth, individuals, events, situations, possible worlds and degrees. The result has been a collection of incompatible classical logics. In this paper, I present sample logic, in particular its semantics (not its axiomatization). Sample logics is a member of the family of probabilistic logics, which is constructive without being truth functional. More specifically, I integrate all the important linguistic data on which the classical logics are predicated. The concepts of (in)dependency and conditional (in)dependency are the cornerstones of sample logic. (shrink)

Almost all set theorists pay at least lip service to Cantor’s definition of a set as a collection of many things into one whole; but empty and singleton sets do not fit with it. Adapting Dana Scott’s axiomatization of the cumulative theory of types, we present a ‘Cantorian’ system which excludes these anomalous sets. We investigate the consequences of their omission, examining their claim to a place on grounds of convenience, and asking whether their absence is an obstacle to the (...) theory’s ability to represent ordered pairs or to support the arithmetization of analysis or the development of the theory of cardinals and ordinals. (shrink)

Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...) como questões acerca das conexões destes com a realidade não mental e extralinguística. A razão daquela qualificação é a seguinte: por um lado, a investigação em questão é qualificada como filosófica em virtude do elevado grau de generalidade e abstracção das questões examinadas (entre outras coisas); por outro, a investigação é qualificada como lógica em virtude de ser uma investigação logicamente disciplinada, no sentido de nela se fazer um uso intenso de conceitos, técnicas e métodos provenientes da disciplina de lógica. O agregado de tópicos que constitui a área de estudos lógico-filosóficos é já visível, pelo menos em parte, no Tractatus Logico-Philosophicus de Ludwig Wittgenstein, uma obra publicada em 1921. E uma boa maneira de ter uma ideia sinóptica do território disciplinar abrangido por esta enciclopédia, ou pelo menos de uma porção substancial dele, é extrair do Tractatus uma lista dos tópicos mais salientes aí discutidos; a lista incluirá certamente tópicos do seguinte género, muitos dos quais se podem encontrar ao longo desta enciclopédia: factos e estados de coisas; objectos; representação; crenças e estados mentais; pensamentos; a proposição; nomes próprios; valores de verdade e bivalência; quantificação; funções de verdade; verdade lógica; identidade; tautologia; o raciocínio matemático; a natureza da inferência; o cepticismo e o solipsismo; a indução; as constantes lógicas; a negação; a forma lógica; as leis da ciência; o número. (shrink)

This essay clarifies quantifier variance and uses it to provide a theory of indefinite extensibility that I call the variance theory of indefinite extensibility. The indefinite extensibility response to the set-theoretic paradoxes sees each argument for paradox as a demonstration that we have come to a different and more expansive understanding of ‘all sets’. But indefinite extensibility is philosophically puzzling: extant accounts are either metasemantically suspect in requiring mysterious mechanisms of domain expansion, or metaphysically suspect in requiring nonstandard assumptions about (...) mathematical objects. Happily, the view of quantifier meanings that underwrites quantifier variance can be used to provide an account of indefinite extensibility that is both metasemantically and metaphysically satisfying. Section 1 introduces the puzzle of indefinite extensibility; section 2 develops and clarifies the metasemantics of quantifier variance; section 3 solves section 1's puzzle of indefinite extensibility by applying section 2's account of quantifier meanings; and section 4 compares the theory developed in section 3 to several other theories in the literature. (shrink)

A neutralist framework is an account of the second-order quantifiers which does not by itself tell us what the ontological commitments of second-order quantification are, but which does tell us that those commitments cannot exceed those of predication. Recently, Wright has suggested that an inferentialist account of the second-order quantifiers is an adequate neutralist framework. I show that we do not have to become inferentialists in the pursuit of a neutralist framework: such a framework can be established within the semantic (...) tradition. (shrink)

According to a two-level criterion for combination tests in the field of ordinary language, moral 'ought'-sentences may be taken to imply 'I intend'-sentences partly semantically and partly pragmatically. If so, a trenchant linguistic analysis of the concept of moral obligation cannot do without a non-classical logic which allows to model these important kinds of ordinary-language implications by means of purely syntactical derivations. For this purpose, an integrated logic of conviction and intention has been tentatively devised by way of a doxastically, (...) buletically, and pragmatically extended calculus of natural deduction. This system of buletic logic cannot even be launched without one or two derivation rules of deductive closedness. However, these very closedness rules appear to be responsible for buletic paradoxes which are analogous to paradoxes long since known from other, less exotic branches of logic but at first sight look much more virulent. After having scrutinized two potential strategies for coping with the paradoxes of buletic logic, finally we can convince ourselves that these paradoxes, as well as their familiar non-buletic counterparts, are but apparent paradoxes, provided we consistently lean on C-CT and do not let pragmatical considerations intrude into purely logical ones. (shrink)

Logic is usually thought to concern itself only with features that sentences and arguments possess in virtue of their logical structures or forms. The logical form of a sentence or argument is determined by its syntactic or semantic structure and by the placement of certain expressions called “logical constants.”[1] Thus, for example, the sentences Every boy loves some girl. and Some boy loves every girl. are thought to differ in logical form, even though they share a common syntactic and semantic (...) structure, because they differ in the placement of the logical constants “every” and “some”. By contrast, the sentences Every girl loves some boy. and Every boy loves some girl. are thought to have the same logical form, because “girl” and “boy” are not logical constants. Thus, in order to settle questions about logical form, and ultimately about which arguments are logically valid and which sentences logically true, we must distinguish the “logical constants” of a language from its nonlogical expressions. (shrink)

Because the conjunction pandq implies p, the value of a bet on pandq cannot exceed the value of a bet on p at the same stakes. We tested recognition of this principle in a betting paradigm that (a) discouraged misreading p as pandnotq, and (b) encouraged genuinely conjunctive reading of pandq. Frequent violations were nonetheless observed. The findings appear to discredit the idea that most people spontaneously integrate the logic of conjunction into their assessments of chance.

This paper sharpens the distinction between inferential and logcon arguments. Inferential arguments represent possible inferences, logcon ones need not. This distinction clarifies the roles that arguments play in accounting for the normativity of validity for inferential reasoning and in establishing the theoretical connection between validity and logical consequence. There are two related takeaways. First, the normativity of validity for inferential reasoning is grounded on the notion of an inferential argument. This will account for the use of validity to judge inference (...) in the face of well-known skepticism that a theory of validity has any special relevance to inferential reasoning. Second, a valid logcon argument needn't be an inferential argument. Accordingly, the normativity of validity for inferential reasoning doesn't require that every valid logcon argument be an inferential argument. The takeaways harmonize the use of validity to evaluate inferential reasoning with the use of the concept of logical consequence to characterize validity. (shrink)

In this paper, I will defend a new compositional semantics for single-domain free logic. This semantics makes use of a distinction between the semantic value of a singular term and its semantic referent. The semantic value of a singular term is conceived of as a set that either contains the semantic referent or no element at all. The semantic referent is the object that the term designates. Before I will introduce this new semantics for single-domain predicate and an S5-type modal (...) logic in detail, I will present five related problems of compositionality of the standard semantics for these logical systems. After that I will show in detail how my new proposed alternative semantics can be used to solve nearly all of the outlined five problems. (shrink)

Recently a number of works in meta-ontology have used a variant of J.H. Harris's collapse argument in the philosophy of logic as an argument against Eli Hirsch's quantifier variance. There have been several responses to the argument in the literature, but none of them have identified the central failing of the argument, viz., the argument has two readings: one on which it is sound but doesn't refute quantifier variance and another on which it is unsound. The central lesson I draw (...) is that arguments against quantifier variance must pay strict attention to issues of translation and interpretation. The paper also has a substantial appendix in which I prove the equivalence of plural mereological nihilism and standard first-order atomistic mereology; results of this kind are often appealed to in the literature on quantifier variance but without many details on the nature or proof of the result. (shrink)

An information recovery problem is the problem of constructing a proposition containing the information dropped in going from a given premise to a given conclusion that folIows. The proposition(s) to beconstructed can be required to satisfy other conditions as well, e.g. being independent of the conclusion, or being “informationally unconnected” with the conclusion, or some other condition dictated by the context. This paper discusses various types of such problems, it presents techniques and principles useful in solving them, and it develops (...) algorithmic methods for certain classes of such problems. The results are then applied to classical number theory, in particular, to questions concerning possible refinements of the 1931 Gödel Axiom Set, e.g. whether any of its axioms can be analyzed into “informational atoms”. Two propositions are “informationally unconnected” [with each other] if no informative (nontautological) consequence of one also follows from the other. A proposition is an “informational atom” if it is informative but no information can be dropped from it without rendering it uninformative (tautological). Presentation, employment, and investigation of these two new concepts are prominent features of this paper. (shrink)

Natural deduction is the type of logic most familiar to current philosophers, and indeed is all that many modern philosophers know about logic. Yet natural deduction is a fairly recent innovation in logic, dating from Gentzen and Jaśkowski in 1934. This article traces the development of natural deduction from the view that these founders embraced to the widespread acceptance of the method in the 1960s. I focus especially on the different choices made by writers of elementary textbooks—the standard conduits of (...) the method to a generation of philosophers—with an eye to determining what the ‘essential characteristics’ of natural deduction are. (shrink)

It is easy to construct pairs of sentences X, Y that lead many people to ascribe higher probability to the conjunction X-and-Y than to the conjuncts X, Y. Whether an error is thereby committed depends on reasoners’ interpretation of the expressions “probability” and “and.” We report two experiments designed to clarify the normative status of typical responses to conjunction problems. © 2004 Cognitive Science Society, Inc. All rights reserved.

Building on recent work by Delia Graff Fara and Ora Matushansky on appellative constructions like ‘Mirka called Roger handsome’, I argue that if Millianism about proper names is true, then the quantifier ‘something’ in ‘Mirka called Roger something’ is best understood as a kind of substitutional quantifier. Any adequate semantics for such quantifiers must explain both the logical behavior of ‘Mirka called Roger something’ and the acceptability of ‘so’-anaphora in ‘Mirka called Roger something, and everyone so called is handsome’. Millianism (...) about proper names is inconsistent with such quantifiers being standard non-substitutional second-order quantifiers. But this is not the only option for Millianism: I provide two different propositional semantics for substitutional quantification, each of which is adequate in the sense above, given Millianism. One of these is based on Tobias Rosefeldt’s work on non-nominal quantification, and I identify in what way Rosefeldt’s semantics is substitutional. (shrink)

It is easy to construct pairs of sentences X, Y that lead many people to ascribe higher probability to the conjunction X‐and‐Y than to the conjuncts X, Y. Whether an error is thereby committed depends on reasoners' interpretation of the expressions “probability” and “and.” We report two experiments designed to clarify the normative status of typical responses to conjunction problems.

Minimalism is the view that our concept of truth is constituted by our disposition to accept instances of the truth schema ‘The proposition that p is true if and only if p’. The generalisation problem is the challenge to account for universal generalisations concerning logical truths such as ‘Every proposition of the form 〈if p, then p〉 is true’. This paper argues that such generalisations can be deduced using a single example of the logical truth in question and a single (...) corresponding instance of the truth schema, employing the logical method of reasoning with arbitrary instances of universal and existential generalisations. Suggesting an inferentialist construal of Minimalism, the paper introduces conditional and general acceptance dispositions, distinguishes inferential meaning constitution from implicit definition, highlights the inferential nature of acceptance of instances of the truth schema, sketches a suitable account of structured propositions, compares higher-order with first-order means of quantification, and argues that the conception of truth Minimalism attributes to ordinary speakers is essentially inferential. It finally applies the deductive strategy to generalisations concerning logical validity as well as more complex logical truths. (shrink)

The paper’s novelty is in combining two comparatively new fields of research: non-transitive logic and the proof method of correspondence analysis. To be more detailed, in this paper the latter is adapted to Weir’s non-transitive trivalent logic \({\mathbf{NC}}_{\mathbf{3}}\). As a result, for each binary extension of \({\mathbf{NC}}_{\mathbf{3}}\), we present a sound and complete Lemmon-style natural deduction system. Last, but not least, we stress the fact that Avron and his co-authors’ general method of obtaining _n_-sequent proof systems for any _n_-valent logic (...) with deterministic or non-deterministic matrices is not applicable to \({\mathbf{NC}}_{\mathbf{3}}\) and its binary extensions. (shrink)

A philosophically important but largely overlooked cognitive theory is examined, one that provides information on which inferences an agent will make from his beliefs. Such a theory of feasible inferences is indispensable in a complete cognitive psychology, in particular, for predicting the agent's actions on the basis of rationality conditions and attributed beliefs and desires. However, very little of the feasibility theory which applies to a typical human being can be shown a priori to apply to all agents. The logical (...) competence required of a rational agent seems to have a cluster structure: it cannot be the case that an agent is able to make no inferences, but an agent can be unable to make any particular one. (shrink)

The idea that sentences can be closer or further apart in meaning is highly intuitive. Not only that, it is also a pillar of logic, semantic theory and the philosophy of science, and follows from other commitments about similarity. The present paper proposes a novel way of comparing the ‘distance’ between two pairs of propositions. We define ‘\ is closer in meaning to \ than \ is to \’ and thereby give a precise account of comparative propositional similarity facts. Notably, (...) our definition eschews metric assumptions, which are unrealistic in most applications of interest. (shrink)

In his bookMinimal Rationality (1986), Christopher Cherniak draws deep and widespread conclusions from our finitude, and not only for philosophy but also for a wide range of science as well. Cherniak's basic idea is that traditional philosophical theories of rationality represent idealisations that are inaccessible to finite rational agents. It is the purpose of this paper to apply a theory of idealisation in science to Cherniak's arguments. The heart of the theory is a distinction between idealisations that represent reversible, solely (...) quantitative simplifications and those that represent irreversible, degenerate idealisations which collapse out essential theoretical structure. I argue that Cherniak's position is best understood as assigning the latter status to traditional rationality theories and that, so understood, his arguments may be illuminated, expanded, and certain common criticisms of them rebutted. The result, however, is a departure from traditional, formalist theories of rationality of a more radical kind than Cherniak contemplates, with widespread ramifications for philosophical theory, especially philosophy of science itself. (shrink)

Fred Sommers passed away in October of 2014 in his 92nd year. Having begun his teaching at Columbia University, he eventually became the Harry A. Wolfson Chair in Philosophy at Brandeis University, where he taught from 1963 to 1993. During his long and productive career, Sommers authored or co-authored over 50 books, articles, reviews, etc., presenting his ideas on numerous occasions throughout North America and Europe. His work was characterized by a commitment to the preservation and application of historical insights (...) and to the value of a well-articulated, coherent logical system. He was recognized for his independence and refusal to accept any view on the basis of authority alone. This made him a formidable critic but accounted in part for his many innovative and original ideas. In spite of his general contrariness in logic, Sommers earned the respect of the majority of his contemporaries, including Russell, Quine, van Benthem, Hacking, Suppes, and Strawson. In 2005, he was the subjec... (shrink)

This article studies the mathematical properties of two systems that model Aristotle's original syllogistic and the relationship obtaining between them. These systems are Corcoran's natural deduction syllogistic and ?ukasiewicz's axiomatization of the syllogistic. We show that by translating the former into a first-order theory, which we call T RD, we can establish a precise relationship between the two systems. We prove within the framework of first-order logic a number of logical properties about T RD that bear upon the same properties (...) of the natural deduction counterpart ? that is, Corcoran's system. Moreover, the first-order logic framework that we work with allows us to understand how complicated the semantics of the syllogistic is in providing us with examples of bizarre, unexpected interpretations of the syllogistic rules. Finally, we provide a first attempt at finding the structure of that semantics, reducing the search to the characterization of the class of models of T RD. (shrink)