In Contradiction advocates and defends the view that there are true contradictions, a view that flies in the face of orthodoxy in Western philosophy since Aristotle. The book has been at the center of the controversies surrounding dialetheism ever since its first publication in 1987. This second edition of the book substantially expands upon the original in various ways, and also contains the author’s reflections on developments over the last two decades. Further aspects of dialetheism are discussed in the companion (...) volume, Doubt Truth to be a Liar, also published by Oxford University Press in 2006. (shrink)

In this rigorous investigation into the logic of truth Anil Gupta and Nuel Belnap explain how the concept of truth works in both ordinary and pathological..

A selective background -- Broadly classical approaches -- Paracompleteness -- More on paracomplete solutions -- Paraconsistent dialetheism.

In this paper, we distinguish two versions of Curry's paradox: c-Curry, the standard conditional-Curry paradox, and v-Curry, a validity-involving version of Curry's paradox that isn’t automatically solved by solving c-curry. A unified treatment of curry paradox thus calls for a unified treatment of both c-Curry and v-Curry. If, as is often thought, c-Curry paradox is to be solved via non-classical logic, then v-Curry may require a lesson about the structure—indeed, the substructure—of the validity relation itself.

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

This paper introduces new logical systems which axiomatize a formal representation of inconsistency (here taken to be equivalent to contradictoriness) in classical logic. We start from an intuitive semantical account of inconsistent data, fixing some basic requirements, and provide two distinct sound and complete axiomatics for such semantics, LFI1 and LFI2, as well as their first-order extensions, LFI1* and LFI2*, depending on which additional requirements are considered. These formal systems are examples of what we dub Logics of Formal Inconsistency (LFI) (...) and form part of a much larger family of similar logics. We also show that there are translations from classical and paraconsistent first-order logics into LFI1* and LFI2*, and back. Hence, despite their status as subsystems of classical logic, LFI1* and LFI2* can codify any classical or paraconsistent reasoning. (shrink)

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 is a sequel to Beall (2011), in which I both give and discuss the philosophical import of a result for the propositional (multiple-conclusion) logic LP+. Feedback on such ideas prompted a spelling out of the first-order case. My aim in this paper is to do just that: namely, explicitly record the first-order result(s), including the collapse results for K3+ and FDE+.

Philosophical applications of familiar paracomplete and paraconsistent logics often rely on an idea of . With respect to the paraconsistent logic LP (the dual of Strong Kleene or K3), such is standardly cashed out via an LP-based nonmonotonic logic due to Priest (1991, 2006a). In this paper, I offer an alternative approach via a monotonic multiple-conclusion version of LP.

This paper presents a theory of belief revision that allows people to come tobelieve in contradictions. The AGM theory of belief revision takes revision,in part, to be consistency maintenance. The present theory replacesconsistency with a weaker property called coherence. In addition to herbelief set, we take a set of statements that she rejects. These two sets arecoherent if they do not overlap. On this theory, belief revision maintains coherence.

The paper explains how a paraconsistent logician can appropriate all classical reasoning. This is to take consistency as a default assumption, and hence to work within those models of the theory at hand which are minimally inconsistent. The paper spells out the formal application of this strategy to one paraconsistent logic, first-order LP. (See, Ch. 5 of: G. Priest, In Contradiction, Nijhoff, 1987.) The result is a strong non-monotonic paraconsistent logic agreeing with classical logic in consistent situations. It is shown (...) that the logical closure of a theory under this logic is trivial only if its closure under LP is trivial. (shrink)