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

Kevin Scharp proposes an original theory of the nature and logic of truth on which truth is an inconsistent concept that should be replaced for certain theoretical purposes. He argues that truth is best understood as an inconsistent concept, and proposes a detailed theory of inconsistent concepts that can be applied to the case of truth. Truth also happens to be a useful concept, but its inconsistency inhibits its utility; as such, it should be replaced with consistent concepts that can (...) do truth's job without giving rise to paradoxes. To this end, Scharp offers a pair of replacements, which he dubs ascending truth and descending truth, along with an axiomatic theory of them and a new kind of possible-worlds semantics for this theory. He goes to develop Davidson's idea that truth is best understood as the core of a measurement system for rational phenomena, and offers a semantic theory that treats truth predicates as assessment-sensitive and solves the problems posed by the liar and other paradoxes. (shrink)

This book introduces an important group of logics that have come to be known under the umbrella term 'susbstructural'. Substructural logics have independently led to significant developments in philosophy, computing and linguistics. _An Introduction to Substrucural Logics_ is the first book to systematically survey the new results and the significant impact that this class of logics has had on a wide range of fields.The following topics are covered: * Proof Theory * Propositional Structures * Frames * Decidability * Coda Both (...) students and professors of philosophy, computing, linguistics, and mathematics will find this to be an important addition to their reading. (shrink)

It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual issues surrounding them, to be a source of interest.This landmark work offers both ...

In Spandrels of Truth, Beall concisely presents and defends a modest, so-called dialetheic theory of transparent truth.

Of the dozens of purported solutions to the liar paradox published in the past fifty years, the vast majority are "traditional" in the sense that they reject one of the premises or inference rules that are used to derive the paradoxical conclusion. Over the years, however, several philosophers have developed an alternative to the traditional approaches; according to them, our very competence with the concept of truth leads us to accept that the reasoning used to derive the paradox is sound. (...) That is, our conceptual competence leads us into inconsistency. I call this alternative the inconsistency approach to the liar. Although this approach has many positive features, I argue that several of the well-developed versions of it that have appeared recently are unacceptable. In particular, they do not recognize that if truth is an inconsistent concept, then we should replace it with new concepts that do the work of truth without giving rise to paradoxes. I outline an inconsistency approach to the liar paradox that satisfies this condition. (shrink)

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

The concept of truth arguably plays a central role in many areas of philosophical theorizing. Yet, what seems to be one of the most fundamental principles governing that concept, i.e. the equivalence between P and , is inconsistent in full classical logic, as shown by the semantic paradoxes. I propose a new solution to those paradoxes, based on a principled revision of classical logic. Technically, the key idea consists in the rejection of the unrestricted validity of the structural principle of (...) contraction. I first motivate philosophically this idea with the metaphysical picture of the states-of-affairs expressed by paradoxical sentences as being distinctively . I then proceed to demonstrate that the theory of truth resulting from this metaphysical picture is, in many philosophically interesting respects, surprisingly stronger than most other theories of truth endorsing the equivalence between P and (for example, the theory vindicates the validity of the traditional laws of excluded middle and of non-contradiction, and also vindicates the traditional constraint of truth preservation on logical consequence). I conclude by proving a cutelimination theorem that shows the consistency of the theory. (shrink)

It's often said that according to deflationary theories of truth, truth is not a ‘substantial’ property. While this is a fine slogan, it is far from transparent what deflationists mean (or ought to mean) in saying that truth is ‘insubstantial’. Focusing so intently upon the concept of truth and the word ‘true’, I argue, deflationists and their critics have been insufficiently attentive to a host of metaphysical complexities that arise for deflationists in connection with the property of truth. My aim (...) is to correct several misunderstandings as to what deflationists are after here—including some harboured by deflationists themselves—and to offer an account of the commitments about truth's nature that they ought to undertake. In developing this account, I focus particularly upon the issue of what metaphysics of truth a Horwichian minimalist ought to adopt. (shrink)

Deflationists about truth seek to undermine debates about the nature of truth by arguing that the truth predicate is merely a device that allows us to express a certain kind of generality. I argue that a parallel approach is available in the case of logical consequence. Just as deflationism about truth offers an alternative to accounts of truth's nature in terms of correspondence or justification, deflationism about consequence promises an alternative to model-theoretic or proof-theoretic accounts of consequence's nature. I then (...) argue, against considerations put forward by Field and Beall, that Curry's paradox no more rules out deflationism about consequence than the liar paradox rules out deflationism about truth. (shrink)

ABSTRACTDo truth tables—the ordinary sort that we use in teaching and explaining basic propositional logic—require an assumption of consistency for their construction? In this essay we show that truth tables can be built in a consistency-independent paraconsistent setting, without any appeal to classical logic. This is evidence for a more general claim—that when we write down the orthodox semantic clauses for a logic, whatever logic we presuppose in the background will be the logic that appears in the foreground. Rather than (...) any one logic being privileged, then, on this count partisans across the logical spectrum are in relatively similar dialectical positions. (shrink)

The paper is concerned with a logical difficulty which Lionel Shapiro’s deflationist theory of logical consequence (as well as the author’s favoured, non-deflationist theory) gives rise to. It is argued that Shapiro’s non-contractive approach to solving the difficulty, although correct in its broad outlines, is nevertheless extremely problematic in some of its specifics, in particular in its failure to validate certain intuitive rules and laws associated with the principle of modus ponens. An alternative non-contractive theory is offered which does not (...) suffer from the same problem. (shrink)

In this paper I urge friends of truth-value gaps and truth-value gluts – proponents of paracomplete and paraconsistent logics – to consider theories not merely as sets of sentences, but as pairs of sets of sentences, or what I call ‘bitheories,’ which keep track not only of what holds according to the theory, but also what fails to hold according to the theory. I explain the connection between bitheories, sequents, and the speech acts of assertion and denial. I illustrate the (...) usefulness of bitheories by showing how they make available a technique for characterising different theories while abstracting away from logical vocabulary such as connectives or quanti- fiers, thereby making theoretical commitments independent of the choice of this or that particular non-classical logic. (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.

On the one hand, the absence of contraction is a safeguard against the logical (property theoretic) paradoxes; but on the other hand, it also disables inductive and recursive definitions, in its most basic form the definition of the series of natural numbers, for instance. The reason for this is simply that the effectiveness of a recursion clause depends on its being available after application, something that is usually assured by contraction. This paper presents a way of overcoming this problem within (...) the framework of a logic based on inclusion and unrestricted abstraction, without any form of extensionality. (shrink)

A number of authors have argued that Peano Arithmetic supplemented with a logical validity predicate is inconsistent in much the same manner as is PA supplemented with an unrestricted truth predicate. In this paper I show that, on the contrary, there is no genuine paradox of logical validity—a completely general logical validity predicate can be coherently added to PA, and the resulting system is consistent. In addition, this observation lead to a number of novel, and important, insights into the nature (...) of logical validity itself. (shrink)

A logic is said to be contraction free if the rule from A→(A→B) to A→B is not truth preserving. It is well known that a logic has to be contraction free for it to support a non-trivial naïve theory of sets or of truth. What is not so well known is that if there is another contracting implication expressible in the language, the logic still cannot support such a naïve theory. A logic is said to be robustly contraction free if (...) there is no such operator expressible in its language. We show that a large class of finitely valued logics are each not robustly contraction free, and demonstrate that some other contraction free logics fail to be robustly contraction free. Finally, the sublogics of Łω (with the standard connectives) are shown to be robustly contraction free. (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 note motivates a logic for a theory that can express its own notion of logical consequence—a ‘syntactically closed’ theory of naive validity. The main issue for such a logic is Curry’s paradox, which is averted by the failure of contraction. The logic features two related, but different, implication connectives. A Hilbert system is proposed that is complete and non-trivial.

Dave Ripley has recently argued against the plausibility of multiset consequence relations and of contraction-free approaches to paradox. For Ripley, who endorses a nontransitive theory, the best arguments that buttress transitivity also push for contraction—whence it is wiser for the substructural logician to go nontransitive from the start. One of Ripley’s allegations is especially insidious, since it assumes the form of a trivialisation result: it is shown that if a multiset consequence relation can be associated to a closure operator in (...) the expected way, then it necessarily contracts. We counter Ripley’s objection by presenting an approach to multiset consequence that escapes this trap. This approach is multiple-conclusioned in a heterodox way, for multiple succedents are given a conjunctive, rather than a disjunctive reading. Finally, we address a further objection by French and Ripley to the effect that the informational interpretation of sequents in linear logic does not motivate cut. (shrink)

We investigate a contractionless naive set theory, due to Grisin [11]. We prove that the theory is undecidable.

The idea of relevant logic—that irrelevant inferences are invalid—is appealing. But the standard semantics for relevant logics involve baroque metaphysics: a three-place accessibility relation, a star operator, and ‘bad’ worlds. In this article we propose that these oddities express a mismatch between non-classical object theory and classical metatheory. A uniformly relevant semantics for relevant logic is a better fit.

Mark Balaguer argues for full blooded platonism (FBP), and argues that FBP alone can solve Benacerraf's familiar epistemic challenge. I note that if FBP really can solve Benacerraf's epistemic challenge, then FBP is not alone in its capacity so to solve; RFBP—really full blooded platonism—can do the trick just as well, where RFBP differs from FBP by allowing entities from inconsistent mathematics. I also argue briefly that there is positive reason for endorsing RFBP.

Curry’s paradox is well known. The original version employed a conditional connective, and is not forthcoming if the conditional does not satisfy contraction. A newer version uses a validity predicate, instead of a conditional, and is not forthcoming if validity does not satisfy structural contraction. But there is a variation of the paradox which uses “external validity”. And since external validity contracts, one might expect the appropriate version of the Curry paradox to be inescapable. In this paper we show that (...) this is not the case. We consider two ways of formalising the notion of external validity, and show that in both of these the paradox is not forthcoming without the appropriate forms of contraction. (shrink)

The Church-Turing Thesis is widely regarded as true, because of evidence that there is only one genuine notion of computation. By contrast, there are nowadays many different formal logics, and different corresponding foundational frameworks. Which ones can deliver a theory of computability? This question sets up a difficult challenge: the meanings of basic mathematical terms are not stable across frameworks. While it is easy to compare what different frameworks say, it is not so easy to compare what they mean. We (...) argue for some minimal conditions that must be met if two frameworks are to be compared; if frameworks are radical enough, comparison becomes hopeless. Our aim is to clarify the dialectical situation in this bourgeoning area of research, shedding light on the nature of non-classical logic and the notion of computation alike. (shrink)

In [7], a naive set theory is introduced based on a polynomial time logical system, Light Linear Logic (LLL). Although it is reasonably claimed that the set theory inherits the intrinsically polytime character from the underlying logic LLL, the discussion there is largely informal, and a formal justification of the claim is not provided sufficiently. Moreover, the syntax is quite complicated in that it is based on a non-traditional hybrid sequent calculus which is required for formulating LLL.In this paper, we (...) consider a naive set theory based on Intuitionistic Light Affine Logic (ILAL), a simplification of LLL introduced by [1], and call it Light Affine Set Theory (LAST). The simplicity of LAST allows us to rigorously verify its polytime character. In particular, we prove that a function over {0, 1}* is computable in polynomial time if and only if it is provably total in LAST. (shrink)

This essay demonstrates proof-theoretically the consistency of a type-free theoryC with an unrestricted principle of comprehension and based on a predicate logic in which contraction (A (A B)) (A B), although it cannot holds in general, is provable for a wide range ofA's.C is presented as an axiomatic theoryCH (with a natural-deduction equivalentCS) as a finitary system, without formulas of infinite length. ThenCH is proved simply consistent by passing to a Gentzen-style natural-deduction systemCG that allows countably infinite conjunctions and in (...) which all theorems ofCH are provable.CG is seen to be a consistent by a normalization argument. It also shown that in a senseC is highly non-extensional. (shrink)

This paper provides a finer analysis of the well-known form of the Local Deduction Theorem in contraction-free logics . An infinite hierarchy of its natural strengthenings is introduced and studied. The main results are the separation of its initial four members and the subsequent collapse of the hierarchy.