Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is concerned with formulae, thereby overlooking other possible accounts. In this paper, we propose to focus, additionally, on a meta-inferential version of Explosion, i.e. which is concerned with inferences or sequents. In doing so, we will offer a new characterization of paraconsistency by means of which a logic is (...) paraconsistent if it invalidates either the inferential or the meta-inferential notion of Explosion. We show the non-triviality of this criterion by discussing a number of logics. On the one hand, logics which validate and invalidate both versions of Explosion, such as classical logic and Asenjo–Priest’s 3-valued logic LP. On the other hand, logics which validate one version of Explosion but not the other, such as the substructural logics TS and ST, introduced by Malinowski and Cobreros, Egré, Ripley and van Rooij, which are obtained via Malinowski’s and Frankowski’s q- and p-matrices, respectively. (shrink)

What sort of logic do we get if we adopt a supervaluational semantics for vagueness? As it turns out, the answer depends crucially on how the standard notion of validity as truth preservation is recasted. There are several ways of doing that within a supervaluational framework, the main alternative being between “global” construals (e.g., an argument is valid iff it preserves truth-under-all-precisifications) and “local” construals (an argument is valid iff, under all precisifications, it preserves truth). The former alternative is by (...) far more popular, but I argue in favor of the latter, for (i) it does not suffer from a number of serious objections, and (ii) it makes it possible to restore global validity as a defined notion. (shrink)

Supervaluationism is a well known theory of vagueness. Subvaluationism is a less well known theory of vagueness. But these theories cannot be taken apart, for they are in a relation of duality that can be made precise. This paper provides an introduction to the subvaluationist theory of vagueness in connection to its dual, supervaluationism. A survey on the supervaluationist theory can be found in the Compass paper of Keefe (2008); our presentation of the theory in this paper will be short (...) to get rapidly into the logical issues. This paper is relatively self-contained. A modest background on propositional modal logic is, though not strictly necessary, advisable. The reader might find useful the Compass papers Kracht (2011) and Negri (2011) (though these papers cover issues of more complexity than what is demanded to follow this paper). (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)

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)

Paraconsistent approaches have received little attention in the literature on vagueness (at least compared to other proposals). The reason seems to be that many philosophers have found the idea that a contradiction might be true (or that a sentence and its negation might both be true) hard to swallow. Even advocates of paraconsistency on vagueness do not look very convinced when they consider this fact; since they seem to have spent more time arguing that paraconsistent theories are at least as (...) good as their paracomplete counterparts, than giving positive reasons to believe on a particular paraconsistent proposal. But it sometimes happens that the weakness of a theory turns out to be its mayor ally, and this is what (I claim) happens in a particular paraconsistent proposal known as subvaluationism. In order to make room for truth-value gluts subvaluationism needs to endorse a notion of logical consequence that is, in some sense, weaker than standard notions of consequence. But this weakness allows the subvaluationist theory to accommodate higher-order vagueness in a way that it is not available to other theories of vagueness (such as, for example, its paracomplete counterpart, supervaluationism). (shrink)

Vagueness provides the first comprehensive examination of a topic of increasing importance in metaphysics and the philosophy of logic and language. Timothy Williamson traces the history of this philosophical problem from discussions of the heap paradox in classical Greece to modern formal approaches such as fuzzy logic. He illustrates the problems with views which have taken the position that standard logic and formal semantics do not apply to vague language, and defends the controversial realistic view that vagueness is a kind (...) of ignorance--that there really is a grain of sand whose removal turns a heap into a non-heap, but we cannot know which one it is. (shrink)

This paper deals with the truth-Conditions and the logic for vague languages. The use of supervaluations and of classical logic is defended; and other approaches are criticized. The truth-Conditions are extended to a language that contains a definitely-Operator and that is subject to higher order vagueness.

In what does the sense of a sentential connective consist? Like many others, I hold that its sense lies in rules that govern deductions. In the present paper, however, I argue that a classical logician should take the relevant deductions to be arguments involving affirmative or negative answers to yes-or-no questions that contain the connective. An intuitionistic logician will differ in concentrating exclusively upon affirmative answers. I conclude by arguing that a well known intuitionistic criticism of classical logic fails if (...) the answer "No" is accorded parity with the answer "Yes". (shrink)

This piece gives an overview of the supervaluationist theory of vagueness. According to that theory, a sentence is true if and only if it is true on all ways of making it precise. This yields borderline case predications that are neither true nor false, but yet classical logic is preserved almost entirely. The article presents the view and some of its merits and briefly compares it with other theories of vagueness. It raises issues about higher-order vagueness and the definitely operator (...) and about the supervaluationist's accounts of truth and validity. (shrink)

In their recent article “A Hierarchy of Classical and Paraconsistent Logics”, Eduardo Barrio, Federico Pailos and Damien Szmuc present novel and striking results about meta-inferential validity in various three valued logics. In the process, they have thrown open the door to a hitherto unrecognized domain of non-classical logics with surprising intrinsic properties, as well as subtle and interesting relations to various familiar logics, including classical logic. One such result is that, for each natural number n, there is a logic which (...) agrees with classical logic on tautologies, inferences, meta-inferences, meta-meta-inferences, meta-meta-...-meta-inferences, but that disagrees with classical logic on n + 1-meta-inferences. They suggest that this shows that classical logic can only be characterized by defining its valid inferences at all orders. In this article, I invoke some simple symmetric generalizations of BPS’s results to show that the problem is worse than they suggest, since in fact there are logics that agree with classical logic on inferential validity to all orders but still intuitively differ from it. I then discuss the relevance of these results for truth theory and the classification problem. (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)

One of the few points of agreement to be found in mainstream responses to the logical and semantic problems generated by vagueness is the view that if any modification of classical logic and semantics is required at all then it will only be such as to admit underdetermined reference and truth-value gaps. Logics of vagueness including many valued logics, fuzzy logics, and supervaluation logics all provide responses in accord with this view. The thought that an adequate response might require the (...) recognition of cases of overdetermination and truth value gluts has few supporters. This imbalance lacks justification. As it happens, Jaskowski's paraconsistent discussive logic-a logic which admits truth value gluts-can be defended by reflecting on similarities between it and the popular supervaluationist analysis of vagueness already in the philosophical literature. A simple dualisation of supervaluation semantics results in a paraconsistent logic of vagueness based on what has been termed subvaluational semantics. (shrink)

In Barrio et al. Barrio Pailos and Szmuc prove that there are systems of logic that agree with classical logic up to any finite meta-inferential level, and disagree with it thereafter. This article presents a generalized sense of meta-inference that extends into the transfinite, and proves analogous results to all transfinite orders.

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.

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)

If a certain semantic relation (which we call 'local consequence') is allowed to guide expectations about which rules are derivable from other rules, these expectations will not always be fulfilled, as we illustrate. An alternative semantic criterion (based on a relation we call 'global consequence'), suggested by work of J.W. Garson, turns out to provide a much better - indeed a perfectly accurate - guide to derivability.

We will present a three-valued consequence relation for metainferences, called CM, defined through ST and TS, two well known substructural consequence relations for inferences. While ST recovers every classically valid inference, it invalidates some classically valid metainferences. While CM works as ST at the inferential level, it also recovers every classically valid metainference. Moreover, CM can be safely expanded with a transparent truth predicate. Nevertheless, CM cannot recapture every classically valid meta-metainference. We will afterwards develop a hierarchy of consequence relations (...) CMn for metainferences of level n. Each CMn recovers every metainference of level n or less, and can be nontrivially expanded with a transparent truth predicate, but cannot recapture every classically valid metainferences of higher levels. Finally, we will present a logic CMω, based on the hierarchy of logics CMn, that is fully classical, in the sense that every classically valid metainference of any level is valid in it. Moreover, CMω can be nontrivially expanded with a transparent truth predicate. (shrink)

The idea that the phenomenon of vagueness might be modelled by a paraconsistent logic has been little discussed in contemporary work on vagueness, just as the idea that paraconsistent logics might be fruitfully applied to the phenomenon of vagueness has been little discussed in contemporary work on paraconsistency. This is prima facie surprising given that the earliest formalisations of paraconsistent logics presented in Jáskowski and Halldén were presented as logics of vagueness. One possible explanation for this is that, despite initial (...) advocacy by pioneers of paraconsistency, the prospects for a paraconsistent account of vagueness are so poor as to warrant little further consideration. In this paper we look at the reasons that might be offered in defence of this negative claim. As we shall show, they are far from compelling. Paraconsistent accounts of vagueness deserve further attention. (shrink)

David Lewis has argued that impossible worlds are nonsense: if there were such worlds, one would have to distinguish between the truths about their contradictory goings-on and contradictory falsehoods about them; and this--Lewis argues--is preposterous. In this paper I examine a way of resisting this argument by giving up the assumption that ‘in so-and-so world’ is a restricting modifier which passes through the truth-functional connectives The outcome is a sort of subvaluational semantics which makes a contradiction ‘A & ~A’ false (...) even when both ‘A’ and ‘~A’ are true, just as supervaluational semantics makes a tautology ‘A v ~A’ true even when neither ‘A’ nor ‘~A’ are. Connections with discussive logics and complications of the account are discussed, and some general morals are drawn. (shrink)

Vagueness, Logic and Ontology explores various responses to the philosophical problems generated by vagueness and its associated paradox - the sorites paradox. Hyde argues that the theoretical space in which vagueness is sometimes ontologically grounded and modelled by a truth-functional logic affords a coherent response to the problems posed by vagueness. Showing how the concept of vagueness can be applied to the world, Hyde's ontological account proposes a substantial revision of orthodox semantics, metaphysics and logic. This book will be of (...) particular interest to readers in philosophy, linguistics, cognitive science and geographic information systems. (shrink)