This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning---one which takes meaning to be constituted by assertibility and deniability conditions---and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical system---ST---that conservatively extends classical (...) logic with a fully transparent truth predicate. This system is shown to allow for classical reasoning over the full (truth-involving) vocabulary, but to be non-transitive. Some special cases where transitivity does hold are outlined. ST is also shown to give rise to a familiar sort of model for non-classical logics: Kripke fixed points on the Strong Kleene valuation scheme. Finally, to give a theory of paradoxical sentences, a distinction is drawn between two varieties of assertion and two varieties of denial. On one variety, paradoxical sentences cannot be either asserted or denied; on the other, they must be both asserted and denied. The target theory is compared favourably to more familiar related systems, and some objections are considered. (shrink)
In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classical notion, and two dual notions simultaneously defined in terms of it, (...) which we call tolerant truth and strict truth. We characterize the space of consequence relations definable in terms of those and discuss the kind of solution this gives to the sorites paradox. We discuss some applications of the framework to the pragmatics and psycholinguistics of vague predicates, in particular regarding judgments about borderline cases. (shrink)
A counterpossible conditional is a counterfactual with an impossible antecedent. Common sense delivers the view that some such conditionals are true, and some are false. In recent publications, Timothy Williamson has defended the view that all are true. In this paper we defend the common sense view against Williamson’s objections.
This paper shows how to conservatively extend classical logic with a transparent truth predicate, in the face of the paradoxes that arise as a consequence. All classical inferences are preserved, and indeed extended to the full (truth—involving) vocabulary. However, not all classical metainferences are preserved; in particular, the resulting logical system is nontransitive. Some limits on this nontransitivity are adumbrated, and two proof systems are presented and shown to be sound and complete. (One proof system allows for Cut—elimination, but the (...) other does not.). (shrink)
Standard approaches to counterfactuals in the philosophy of explanation are geared toward causal explanation. We show how to extend the counterfactual theory of explanation to non-causal cases, involving extra-mathematical explanation: the explanation of physical facts by mathematical facts. Using a structural equation framework, we model impossible perturbations to mathematics and the resulting differences made to physical explananda in two important cases of extra-mathematical explanation. We address some objections to our approach.
This paper presents and defends a way to add a transparent truth predicate to classical logic, such that and A are everywhere intersubstitutable, where all T-biconditionals hold, and where truth can be made compositional. A key feature of our framework, called STTT (for Strict-Tolerant Transparent Truth), is that it supports a non-transitive relation of consequence. At the same time, it can be seen that the only failures of transitivity STTT allows for arise in paradoxical cases.
ABSTRACT Our goal in this paper is to extend counterfactual accounts of scientific explanation to mathematics. Our focus, in particular, is on intra-mathematical explanations: explanations of one mathematical fact in terms of another. We offer a basic counterfactual theory of intra-mathematical explanations, before modelling the explanatory structure of a test case using counterfactual machinery. We finish by considering the application of counterpossibles to mathematical explanation, and explore a second test case along these lines.
The purpose of this essay is to shed some light on a certain type of sentence, which I call a borderline contradiction. A borderline contradiction is a sentence of the form F a ∧ ¬F a, for some vague predicate F and some borderline case a of F , or a sentence equivalent to such a sentence. For example, if Jackie is a borderline case of ‘rich’, then ‘Jackie is rich and Jackie isn’t rich’ is a borderline contradiction. Many theories (...) of vague language have entailments about borderline contradictions; correctly describing the behavior of borderline contradictions is one of the many tasks facing anyone offering a theory of vague language. Here, I first briefly review claims made by various theorists about these borderline contradictions, attempting to draw out some predictions about the behavior of ordinary speakers. Second, I present an experiment intended to gather relevant data about the behavior of ordinary speakers. Finally, I discuss the experimental results in light of several different theories of vagueness, to see what explanations are available. My conclusions are necessarily tentative; I do not attempt to use the present experiment to demonstrate that any single theory is incontrovertibly true. Rather, I try to sketch the auxiliary hypotheses that would need to be conjoined to several extant theories of vague language to predict the present result, and offer some considerations regarding the plausibility of these various hypotheses. In the end, I conclude that two of the theories I consider are better-positioned to account for the observed data than are the others. But the field of logically-informed research on people’s actual responses to vague predicates is young; surely as more data come in we will learn a great deal more about which (if any) of these theories best accounts for the behavior of ordinary speakers. (shrink)
Three leading philosopher-logicians present a clear and concise overview of formal theories of truth, explaining key logical techniques. Truth is as central topic in philosophy: formal theories study the connections between truth and logic, including the intriguing challenges presented by paradoxes like the Liar.
One of the most dominant approaches to semantics for relevant (and many paraconsistent) logics is the Routley-Meyer semantics involving a ternary relation on points. To some (many?), this ternary relation has seemed like a technical trick devoid of an intuitively appealing philosophical story that connects it up with conditionality in general. In this paper, we respond to this worry by providing three different philosophical accounts of the ternary relation that correspond to three conceptions of conditionality. We close by briefly discussing (...) a general conception of conditionality that may unify the three given conceptions. (shrink)
This paper consider Prior's connective Tonk from a particular bilateralist perspective. I show that there is a natural perspective from which we can see Tonk and its ilk as perfectly well-defined pieces of vocabulary; there is no need for restrictions to bar things like Tonk.
This paper discusses two distinct strategies that have been adopted to provide fine-grained propositions; that is, propositions individuated more finely than sets of possible worlds. One strategy takes propositions to have internal structure, while the other looks beyond possible worlds, and takes propositions to be sets of circumstances, where possible worlds do not exhaust the circumstances. The usual arguments for these positions turn on fineness-of-grain issues: just how finely should propositions be individuated? Here, I compare the two strategies with an (...) eye to the fineness-of-grain question, arguing that when a wide enough range of data is considered, we can see that a circumstance-based approach, properly spelled out, outperforms a structure-based approach in answering the question. (Part of this argument involves spelling out what I take to be a reasonable circumstance-based approach.) An argument to the contrary, due to Soames, is also considered. (shrink)
For some reason, participants hold agents more responsible for their actions when a situation is described concretely than when the situation is described abstractly. We present examples of this phenomenon, and survey some attempts to explain it. We divide these attempts into two classes: affective theories and cognitive theories. After criticizing both types of theories we advance our novel hypothesis: that people believe that whenever a norm is violated, someone is responsible for it. This belief, along with the familiar workings (...) of cognitive dissonance theory, is enough to not only explain all of the abstract/concrete paradoxes, but also explains seemingly unrelated effects, like the anthropomorphization of malfunctioning inanimate objects. (shrink)
Substructural theories of truth are theories based on logics that do not include the full complement of usual structural rules. Existing substructural approaches fall into two main families: noncontractive approaches and nontransitive approaches. This paper provides a sketch of these families, and argues for two claims: first, that substructural theories are better-positioned than other theories to grapple with the truth-theoretic paradoxes, and second—more tentatively—that nontransitive approaches are in turn better-positioned than noncontractive approaches.
Supervaluational theories of vagueness have achieved considerable popularity in the past decades, as seen in eg [5], [12]. This popularity is only natural; supervaluations let us retain much of the power and simplicity of classical logic, while avoiding the commitment to strict bivalence that strikes many as implausible. Like many nonclassical logics, the supervaluationist system SP has a natural dual, the subvaluationist system SB, explored in eg [6], [28].1 As is usual for such dual systems, the classical features of SP (...) (typically viewed as benefits) appear in SB in ‘mirror-image’ form, and the nonclassical features of SP (typically viewed as costs) also appear in SB in ‘mirror-image’ form. Given this circumstance, it can be difficult to decide which of two dual systems is better suited for an approach to vagueness.2 The present paper starts from a consideration of these two approaches— the supervaluational and the subvaluational—and argues that neither of them is well-positioned to give a sensible logic for vague language. §2 presents the systems SP and SB and argues against their usefulness. Even if we suppose that the general picture of vague language they are often taken to embody is accurate, we ought not arrive at systems like SP and SB. Instead, such a picture should lead us to truth-functional systems like strong Kleene logic (K3) or its dual LP. §3 presents these systems, and argues that supervaluationist and subvaluationist understandings of language are better captured there; in particular, that a dialetheic approach to vagueness based on the logic LP is a more sensible approach. §4 goes on to consider the phenomenon of higher-order vagueness within an LP-based approach, and §5 closes with a consideration of the sorites argument itself. (shrink)
This paper provides a defense of the full strength of classical logic, in a certain form, against those who would appeal to semantic paradox or vagueness in an argument for a weaker logic. I will not argue that these paradoxes are based on mistaken principles; the approach I recommend will extend a familiar formulation of classical logic by including a fully transparent truth predicate and fully tolerant vague predicates. It has been claimed that these principles are not compatible with classical (...) logic; I will argue, by both drawing on previous work and presenting new work in the same vein, that this is not so. We can combine classical logic with these intuitive principles, so long as we allow the result to be nontransitive. In the end, I hope the paper will help us to handle familiar paradoxes within classical logic; along the way, I hope to shed some light on what classical logic might be for. (shrink)
We present four classical theories of counterpossibles that combine modalities and counterfactuals. Two theories are anti-vacuist and forbid vacuously true counterfactuals, two are quasi-vacuist and allow counterfactuals to be vacuously true when their antecedent is not only impossible, but also inconceivable. The theories vary on how they restrict the interaction of modalities and counterfactuals. We provide a logical cartography with precise acceptable boundaries, illustrating to what extent nonvacuism about counterpossibles can be reconciled with classical logic.
At least since [Frege, 1960] and [Geach, 1965], there has been some consensus about the relation between negation, the speech act of denial, and the attitude of rejection: a denial, the consensus has had it, is the assertion of a negation, and a rejection is a belief in a negation. Recently, though, there have been notable deviations from this orthodox view. Rejectivists have maintained that negation is to be explained in terms of denial or rejection, rather than vice versa. Some (...) other theorists have maintained that negation is a separate phenomenon from denial, and that neither is to be explained in terms of the other. In this paper, I present and consider these heterodox theories of the relation between negation, denial, and rejection. (shrink)
Some theorists have developed formal approaches to truth that depend on counterexamples to the structural rules of contraction. Here, we study such approaches, with an eye to helping them respond to a certain kind of objection. We define a contractive relative of each noncontractive relation, for use in responding to the objection in question, and we explore one example: the contractive relative of multiplicative-additive affine logic with transparent truth, or MAALT. -/- .
This chapter attempts to give a brief overview of nonclassical (-logic) theories of truth. Due to space limitations, we follow a victory-through-sacrifice policy: sacrifice details in exchange for clarity of big-picture ideas. This policy results in our giving all-too-brief treatment to certain topics that have dominated discussion in the non-classical-logic area of truth studies. (This is particularly so of the ‘suitable conditoinal’ issue: §4.3.) Still, we present enough representative ideas that one may fruitfully turn from this essay to the more-detailed (...) cited works for further study. Throughout – again, due to space – we focus only on the most central motivation for standard non-classical-logic-based truth theories: namely, truth-theoretic paradox (specifically, due to space, the liar paradox). (shrink)
Some theorists think that the more we get to know about the neural underpinnings of our behaviors, the less likely we will be to hold people responsible for their actions. This intuition has driven some to suspect that as neuroscience gains insight into the neurological causes of our actions, people will cease to view others as morally responsible for their actions, thus creating a troubling quandary for our legal system. This paper provides empirical evidence against such intuitions. Particularly, our studies (...) of folk intuitions suggest that (1) when the causes of an action are described in neurological terms, they are not found to be any more exculpatory than when described in psychological terms, and (2) agents are not held fully responsible even for actions that are fully neurologically caused. (shrink)
I consider the phenomenon of conflation—treating distinct things as one—and develop logical tools for modeling it. These tools involve a purely consequence-theoretic treatment, independent of any proof or model theory, as well as a four-valued valuational treatment.
Suppose Alice asserts p, and the Caterpillar wants to disagree. If the Caterpillar accepts classical logic, he has an easy way to indicate this disagreement: he can simply assert ¬p. Sometimes, though, things are not so easy. For example, suppose the Cheshire Cat is a paracompletist who thinks that p ∨ ¬p fails (in familiar (if possibly misleading) language, the Cheshire Cat thinks p is a gap). Then he surely disagrees with Alice's assertion of p, but should himself be unwilling (...) to assert ¬p. So he cannot simply use the classical solution. Dually, suppose the Mad Hatter is a dialetheist who thinks that p ∧ ¬p holds (that is, he thinks p is a glut). Then he may assert ¬p, but it should not be taken to indicate that he disagrees with Alice; he doesn't. So he too can't use the classical solution. The Cheshire Cat and the Mad Hatter, then, have a common problem, and philosophers with opinions like theirs have adopted a common solution to this problem: appeal to denial. Denial, these philosophers suppose, is a speech act like assertion, but it is not to be understood as in any way reducing to assertion. Importantly, denial is something different from the assertion of a negation; this is what allows it to work even in cases where assertion of negation does not. Just as importantly, denial must express disagreement, since this is the job it's being enlisted to do. (shrink)
This paper considers some issues to do with valuational presentations of consequence relations, and the Galois connections between spaces of valuations and spaces of consequence relations. Some of what we present is known, and some even well-known; but much is new. The aim is a systematic overview of a range of results applicable to nonreflexive and nontransitive logics, as well as more familiar logics. We conclude by considering some connectives suggested by this approach.
This paper considers some issues to do with valuational presentations of consequence relations, and the Galois connections between spaces of valuations and spaces of consequence relations. Some of what we present is known, and some even well-known; but much is new. The aim is a systematic overview of a range of results applicable to nonreflexive and nontransitive logics, as well as more familiar logics. We conclude by considering some connectives suggested by this approach.
We say that a sentence A is a permissive consequence of a set X of premises whenever, if all the premises of X hold up to some standard, then A holds to some weaker standard. In this paper, we focus on a three-valued version of this notion, which we call strict-to-tolerant consequence, and discuss its fruitfulness toward a unified treatment of the paradoxes of vagueness and self-referential truth. For vagueness, st-consequence supports the principle of tolerance; for truth, it supports the (...) requisite of transparency. Permissive consequence is non-transitive, however, but this feature is argued to be an essential component to the understanding of paradoxical reasoning in cases involving vagueness or self-reference. (shrink)
The recent development and exploration of mixed metainferential logics is a breakthrough in our understanding of nontransitive and nonreflexive logics. Moreover, this exploration poses a new challenge to theorists like me, who have appealed to similarities to classical logic in defending the logic ST, since some mixed metainferential logics seem to bear even more similarities to classical logic than ST does. There is a whole ST-based hierarchy, of which ST itself is only the first step, that seems to become more (...) and more classical at each level. I think this seeming is misleading: for certain purposes, anyhow, metainferential hierarchies give us no reason to move on from ST. ST is indeed only the first step on a grand metainferential adventure; but one step is enough. This paper aims to explain and defend that claim. Along the way, I take the opportunity also to develop some formal tools and results for thinking about metainferential logics more generally. (shrink)
In a previous paper (see ‘Tolerant, Classical, Strict’, henceforth TCS) we investigated a semantic framework to deal with the idea that vague predicates are tolerant, namely that small changes do not affect the applicability of a vague predicate even if large changes do. Our approach there rests on two main ideas. First, given a classical extension of a predicate, we can define a strict and a tolerant extension depending on an indifference relation associated to that predicate. Second, we can use (...) these notions of satisfaction to define mixed consequence relations that capture non-transitive tolerant reasoning. Although we gave some empirical motivation for the use of strict and tolerant extensions, making use of them commits us to the view that sentences of the form ‘ p∨¬p ’ and ‘ p∧¬p ’ are not automatically valid or unsatisfiable, respectively. Some philosophers might take this commitment as a negative outcome of our previous proposal. We think, however, that the general ideas underlying our previous approach to vagueness can be implemented in a variety of ways. This paper explores the possibility of defining mixed notions of consequence in the more classical super/sub-valuationist setting and examines to what extent any of these notions captures non-transitive tolerant reasoning. (shrink)
In this paper, I consider the connection between consequence relations and closure operations. I argue that one familiar connection makes good sense of some usual applications of consequence relations, and that a largeish family of familiar noncontractive consequence relations cannot respect this familiar connection.
In some logics, anything whatsoever follows from a contradiction; call these logics explosive. Paraconsistent logics are logics that are not explosive. Paraconsistent logics have a long and fruitful history, and no doubt a long and fruitful future. To give some sense of the situation, I’ll spend Section 1 exploring exactly what it takes for a logic to be paraconsistent. It will emerge that there is considerable open texture to the idea. In Section 2, I’ll give some examples of techniques for (...) developing paraconsistent logics. In Section 3, I’ll discuss what seem to me to be some promising applications of certain paraconsistent logics. In fact, however, I don’t think there’s all that much to the concept ‘paraconsistent’ itself; the collection of paraconsistent logics is far too heterogenous to be very productively dealt with under a single label. Perhaps that will emerge as we go. (shrink)
This paper proposes an experimental investigation of the use of vague predicates in dynamic sorites. We present the results of two studies in which subjects had to categorize colored squares at the borderline between two color categories (Green vs. Blue, Yellow vs. Orange). Our main aim was to probe for hysteresis in the ordered transitions between the respective colors, namely for the longer persistence of the initial category. Our main finding is a reverse phenomenon of enhanced contrast (i.e. negative hysteresis), (...) present in two different tasks, a comparative task involving two color names, and a yes/no task involving a single color name, but not found in a corresponding color matching task. We propose an optimality-theoretic explanation of this effect in terms of the strict-tolerant framework of Cobreros et al. (J Philos Log 1–39, 2012), in which borderline cases are characterized in a dual manner in terms of overlap between tolerant extensions, and underlap between strict extensions. (shrink)
In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the strict-tolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+’s external logic and they question whether ST+’s solution to the semantic paradoxes is fundamentally different from LP+’s. Here we establish that by parity of reasoning, ST+ can be related to LP+’s dual logic K3+. We clarify the distinction between internal and external logic and (...) argue that while ST+’s nonclassicality can be granted, its self-dual character does not tie it to LP+ more closely than to K3+. (shrink)
Arguments based on Leibniz's Law seem to show that there is no room for either indefinite or contingent identity. The arguments seem to prove too much, but their conclusion is hard to resist if we want to keep Leibniz's Law. We present a novel approach to this issue, based on an appropriate modification of the notion of logical consequence.
Arguments based on Leibniz's Law seem to show that there is no room for either indefinite or contingent identity. The arguments seem to prove too much, but their conclusion is hard to resist if we want to keep Leibniz's Law. We present a novel approach to this issue, based on an appropriate modification of the notion of logical consequence.
We investigate two different broad traditions in the abstract valuational model theory for nontransitive and nonreflexive logics. The first of these traditions makes heavy use of the natural Galois connection between sets of valuations and sets of arguments. The other, originating with work by Grzegorz Malinowski on nonreflexive logics, and best systematized in Blasio et al. : 233–262, 2017), lets sets of arguments determine a more restricted set of valuations. After giving a systematic discussion of these two different traditions in (...) the valuational model theory for substructural logics, we turn to looking at the ways in which we might try to compare two sets of valuations determining the same set of arguments. (shrink)
We propose Knobe's explanation of his cases encounters a dilemma: Either his explanation works and, counterintuitively, morality is not at the heart of these effects; or morality is at the heart of the effects and Knobe's explanation does not succeed. This dilemma is then used to temper the use of the Knobe paradigm for discovering moral norms.
Uncut is a book about two kinds of paradoxes: paradoxes involving truth and its relatives, like the liar paradox, and paradoxes involving vagueness. There are lots of ways to look at these paradoxes, and lots of puzzles generated by them, and Uncut ignores most of this variety to focus on a single issue. That issue: do our words mean what they seem to mean, and if so, how can this be? I claim that our words do mean what they seem (...) to, and yet our language is not undermined by paradox. By developing a distinctive theory of meaning, I show how this can be. (shrink)
In Heck, Richard Heck presents variants on the familiar liar paradox, intended to reveal limitations of theories of transparent truth. But all existing theories of transparent truth can respond to Heck's variants in just the same way they respond to the liar. These new variants thus put no new pressure on theories of transparent truth.
As we’ve seen in the last chapter, there is good linguistic reason to categorize negations (and negative operators in general) by which De Morgan laws they support. The weakest negative operators (merely downward monotonic) support only two De Morgan laws;1 medium-strength negative operators support a third;2 and strong negative operators support all four. As we’ve also seen, techniques familiar from modal logic are of great use in giving unifying theories of negative operators. In particular, Dunn’s (1990) distributoid theory allows us (...) to generate relational semantics for many negations. However, the requirements of distributoid theory are a bit too strict for use in modeling the weakest negations. For a relational semantics to work, an operator must either distribute or antidistribute over either conjunction or disjunction; but the merely downward monotonic operators do not. Thus, a unifying semantics cannot be had in distributoid theory. In the (more familiar) study of positive modalities, there is a parallel result. Normal necessities distribute over conjunction, and normal possibilities over disjunction. When these distributions break down, a relational semantics is no longer appropriate. Here, there is a somewhat familiar solution: neighborhood semantics. In this chapter, I’ll adapt neighborhood semantics to the less familiar case of negative modalities, showing how it can be used to give a single semantic framework appropriate to all the pertinent sorts of negative operators. (shrink)
We present an objection to Beall & Henderson’s recent paper defending a solution to the fundamental problem of conciliar Christology using qua or secundum clauses. We argue that certain claims the acceptance/rejection of which distinguish the Conciliar Christian from others fail to so distinguish on Beall & Henderson’s 0-Qua view. This is because on their 0-Qua account, these claims are either acceptable both to Conciliar Christians as well as those who are not Conciliar Christians or because they are acceptable to (...) neither. (shrink)