In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...) of our PIF account of truth-talk, we demonstrate a few advantages it offers over T-deflationist accounts that do not explicitly acknowledge pretense at work in the discourse. In turning to the Liar Paradox, we explain how the quasi-anaphoric functioning that our account attributes to truth-talk provides a diagnosis of the Liar Paradox (and other instances of semantic pathology) as having no content—in the sense of not specifying any of what we call M-conditions. At the same time, however, we vindicate the intuition that we can understand liar sentences, thereby avoiding one standard objection to “meaningless strategy” responses to the Liar Paradox. With this diagnosis in place, we then, by way of treatment, introduce a new predicate, ‘semantically defective’, and show how the explanation we give for its application allows for a consistent, yet revenge-immune, (dis)solution of the Liar Paradox, and semantic pathology generally. (shrink)

This book contains a selection of the papers presented at the Logic, Reasoning and Rationality 2010 conference in Ghent. The conference aimed at stimulating the use of formal frameworks to explicate concrete cases of human reasoning, and conversely, to challenge scholars in formal studies by presenting them with interesting new cases of actual reasoning. According to the members of the Wiener Kreis, there was a strong connection between logic, reasoning, and rationality and that human reasoning is rational in so far (...) as it is based on logic. Later, this belief came under attack and logic was deemed inadequate to explicate actual cases of human reasoning. Today, there is a growing interest in reconnecting logic, reasoning and rationality. A central motor for this change was the development of non-classical logics and non-classical formal frameworks. The book contains contributions in various non-classical formal frameworks, case studies that enhance our apprehension of concrete reasoning patterns, and studies of the philosophical implications for our understanding of the notions of rationality. (shrink)

Ultralogic as Universal? is a seminal text in non-classcial logic. Richard Routley presents a hugely ambitious program: to use an 'ultramodal' logic as a universal key, which opens, if rightly operated, all locks. It provides a canon for reasoning in every situation, including illogical, inconsistent and paradoxical ones, realized or not, possible or not. A universal logic, Routley argues, enables us to go where no other logic—especially not classical logic—can. Routley provides an expansive and singular vision of how a universal (...) logic might one day solve major problems in set theory, arithmetic, linguistics, physics, and more. It circulated in typescript in the late 1970s before appearing as the Appendix to Exploring Meinong's Jungle and Beyond. With engaging, forceful prose, unsparing criticism of entrenched institutions, and many tantalizing proof sketches, Ultralogic? has had a major influence on the development of paraconsistent and relevant logic. This new edition makes this work available for a modern audience, newly typeset and corrected, along with extensive notes, and new commentary essays. (shrink)

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)

A unified answer is offered to two distinct fundamental questions: whether a nonclassical solution to the semantic paradoxes should be extended to other apparently similar paradoxes and whether a nonclassical logic should be expressed in a nonclassical metalanguage. The paper starts by reviewing a budget of paradoxes involving the logical properties of validity, inconsistency, and compatibility. The author’s favored substructural approach to naive truth is then presented and it is explained how that approach can be extended in a very natural (...) way so as to solve a certain paradox of validity. However, three individually decisive reasons are later provided for thinking that no approach adopting a classical metalanguage can adequately account for all the features involved in the paradoxes of logical properties. Consequently, the paper undertakes the task to do better, and, building on the system already developed, introduces a theory in a nonclassical metalanguage that expresses an adequate logic of naive truth and of some naive logical properties. (shrink)

The notion of a proposition is central to philosophy. But it is subject to paradoxes. A natural response is a hierarchical account and, ever since Russell proposed his theory of types in 1908, this has been the strategy of choice. But in this paper I raise a problem for such accounts. While this does not seem to have been recognized before, it would seem to render existing such accounts inadequate. The main purpose of the paper, however, is to provide a (...) new hierarchical account that solves the problem. (shrink)

I argue that dialetheists have a problem with the concept of logical consequence. The upshot of this problem is that dialetheists must appeal to a hierarchy of concepts of logical consequence. Since this hierarchy is akin to those invoked by more orthodox resolutions of the semantic paradoxes, its emergence would appear to seriously undermine the dialetheic treatments of these paradoxes. And since these are central to the case for dialetheism, this would represent a significant blow to the position itself.

I argue that dialetheists have a problem with the concept of logical consequence. The upshot of this problem is that dialetheists must appeal to a hierarchy of concepts of logical consequence. Since this hierarchy is akin to those invoked by more orthodox resolutions of the semantic paradoxes, its emergence would appear to seriously undermine the dialetheic treatments of these paradoxes. And since these are central to the case for dialetheism, this would represent a significant blow to the position itself.

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)

This paper begins an axiomatic development of naive set theoryin a paraconsistent logic. Results divide into two sorts. There is classical recapture, where the main theorems of ordinal and Peano arithmetic are proved, showing that naive set theory can provide a foundation for standard mathematics. Then there are major extensions, including proofs of the famous paradoxes and the axiom of choice (in the form of the well-ordering principle). At the end I indicate how later developments of cardinal numbers will lead (...) to Cantor’s theorem, the existence of large cardinals, and a counterexample to the continuum hypothesis. (shrink)

Closure is the idea that what is true about a theory of truth should be true in it. Commitment to closure under truth motivates non-classical logic; commitment to closure under validity leads to substructural logic. These moves can be thought of as responses to revenge problems. With a focus on truth in mathematics, I will consider whether a noncontractive approach faces a similar revenge problem with respect to closure under provability, and argue that if a noncontractive theory is to be (...) genuinely closed, then it must be free of all contraction, even in the metatheory. (shrink)

The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. This paper considers the sub-problem of expressing extensional identity and the subset relation in paraconsistent, relevant solutions, in light of a recent proposal from Beall, Brady, Hazen, Priest and Restall [4]. The main result is that the proposal, in the context of an independently motivated formalization of naive set theory, leads (...) to triviality. (shrink)

There appears to be few, if any, limits on what sorts of logical connectives can be added to a given logic. One source of potential limitations is the motivating ideology associated with a logic. While extraneous to the logic, the motivating ideology is often important for the development of formal and philosophical work on that logic, as is the case with intuitionistic logic. One family of logics for which the philosophical ideology is important is the family of relevant logics. In (...) this paper, I explore the limits of what a relevant connective is, showing how some basic criteria motivated by the ideology of relevant logicians provide robust limits on potential connectives. These criteria provide some plausible necessary conditions on being a relevant connective. (shrink)

In Saving Truth from Paradox, Hartry Field presents and defends a theory of truth with a new conditional. In this paper, I present two criticisms of this theory, one concerning its assessments of validity and one concerning its treatment of truth-preservation claims. One way of adjusting the theory adequately responds to the truth-preservation criticism, at the cost of making the validity criticism worse. I show that in a restricted setting, Field has a way to respond to the validity criticism. I (...) close with some general considerations on the use of revision-theoretic methods in theories of truth. (shrink)

Circular denitions have primarily been studied in revision theory in the classical scheme. I present systems of circular denitions in the Strong Kleene and supervaluation schemes and provide complete proof systems for them. One class of denitions, the intrinsic denitions, naturally arises in both schemes. I survey some of the features of this class of denitions.

Rejecting structural contraction has been proposed as a strategy for escaping semantic paradoxes. The challenge for its advocates has been to make intuitive sense of how contraction might fail. I offer a way of doing so, based on a “naive” interpretation of the relation between structure and logical vocabulary in a sequent proof system. The naive interpretation of structure motivates the most common way of blaming Curry-style paradoxes on illicit contraction. By contrast, the naive interpretation will not as easily motivate (...) one recent noncontractive approach to the Liar paradox. (shrink)

This article shows that there is a liar-like paradox that arises for rational credence that relies only on very weak logical and credal principles. The paradox depends on a weak rational reflection principle, logical principles governing conjunction, and principles governing the relationship between rational credence and proof. To respond to this paradox, we must either reject even very weak rational reflection principles or reject some highly plausible logical or credal principle.

It is known that a number of inference principles can be used to trivialise the axioms of naïve comprehension - the axioms underlying the naïve theory of sets. In this paper we systematise and extend these known results, to provide a number of general classes of axioms responsible for trivialising naïve comprehension.

Curry's paradox, sometimes described as a general version of the better known Russell's paradox, has intrigued logicians for some time. This paper examines the paradox in a natural deduction setting and critically examines some proposed restrictions to the logic by Fitch and Prawitz. We then offer a tentative counterexample to a conjecture by Tennant proposing a criterion for what is to count as a genuine paradox.

In his paper [6], Greg Restall conjectured that a logic supports a naïve comprehension scheme if and only if it is robustly contraction free, that is, if and only if no contracting connective is definable in terms of the primitive connectives of the logic. In this paper, we present infinitely many counterexamples to Restall''s conjecture, in the form of purely implicational logics which are robustly contraction free, but which trivialize naïve comprehension.

Different natural deduction proof systems for intuitionistic and classical logic —and related logical systems—differ in fundamental properties while sharing significant family resemblances. These differences become quite stark when it comes to the structural rules of contraction and weakening. In this paper, I show how Gentzen and Jaśkowski’s natural deduction systems differ in fine structure. I also motivate directed proof nets as another natural deduction system which shares some of the design features of Genzen and Jaśkowski’s systems, but which differs again (...) in its treatment of the structural rules, and has a range of virtues absent from traditional natural deduction systems. (shrink)

Dialetheists concerning the paradoxes of self-refrence have often argued that the phenomeonon provides a choice between inconsistency and expressive incompleteness, and that inconsistency is the correct choice. In a recent paper 75: 573-84), JC Beall attacks this argument. This paper analyses his arguments, and argues that his paper simply provides a new spin on matters well known.

IntroductionCurry’s paradox is well known.See, e.g., Priest , ch. 6. It comes in both set theoretic and semantic versions. Here we will concentrate on the semantic versions. Historically, these have deployed the notion of truth. Those who wish to endorse an unrestricted T-schema have mainly endorsed a logic which rejects the principle of Absorption, \\models A\rightarrow B\). High profile logics of this kind are certain relevant logics; these have semantics which show how and why this principle is not valid. Of (...) more recent times, paradoxes which are clearly in the same family have been appearing; but these concern the notion of validity itself. The standard semantics of relevant logics seem powerless to address these. But they can. This note shows how. The upshot can be seen as a return to the roots of relevant logic, in a sense to become clear.BackgroundThe Usual Curry ParadoxesLet us start with a couple of standard forms of the paradox. I .. (shrink)

We have seen that proofs of soundness of (Boolean) DS, EFQ and of ABS — and hence the legitimation of these inferences — can be achieved only be appealing to the very form of reasoning in question. But this by no means implies that we have to fall back on classical reasoning willy-nilly. Many logical theories can provide the relevant boot-strapping. Decision between them has, therefore, to be made on other grounds. The grounds include the many criteria familiar from the (...) philosophy of science: theoretical integrity (e.g., paucity of ad hoc hypotheses), adequacy to the data (explaining the data of inference —all inferences, not just those chosen from consistent domains!) and so on. This paper has not attempted to address these issues in general. All it demonstrates is that the charge that a dialetheist solution to the semantic paradoxes can be maintained only by making some intelligible notion ineffable cannot be made to stick. The dialetheist has a coherent position, endorsing the T-scheme, but rejecting DS, EFQ (even Boolean DS and EFQ) and ABS. And any argument to the effect that the relevant notions are both ineffable and intelligible begs the question. The case against consistent “solutions” to the semantic paradoxes therefore remains intact. (shrink)

Although formal analysis provides us with interesting tools for treating Curry’s paradox, it certainly does not exhaust every possible reading of it. Thus, we suggest that this paradox should be analysed with non-formal tools coming from pragmatics. In this way, using Grice’s logic of conversation, we will see that Curry’s sentence can be reinterpreted as a peculiar conditional sentence implying its own consequent.

A proof employing no semantic terms is offered in support of the claim that there can be truths without truthmakers. The logical resources used in the proof are weak but do include the structural rule Contraction.

This paper begins an analysis of the real line using an inconsistency-tolerant (paraconsistent) logic. We show that basic field and compactness properties hold, by way of novel proofs that make no use of consistency-reliant inferences; some techniques from constructive analysis are used instead. While no inconsistencies are found in the algebraic operations on the real number field, prospects for other non-trivializing contradictions are left open.

We group the existing variants of the familiar set-theoretical and truth-theoretical paradoxes into two classes: connective paradoxes, which can in principle be ascribed to the presence of a contracting connective of some sort, and structural paradoxes, where at most the faulty use of a structural inference rule can possibly be blamed. We impute the former to an equivocation over the meaning of logical constants, and the latter to an equivocation over the notion of consequence. Both equivocation sources are tightly related, (...) and can be cleared up by adopting a particular substructural logic in place of classical logic. We then argue that our perspective can be justified via an informational semantics of contraction-free substructural logics. (shrink)

After an introduction to set the stage, we consider some variations on the reasoning behind Curry's Paradox arising against the background of classical propositional logic and of BCI logic and one of its extensions, in the latter case treating the "paradoxicality" as a matter of nonconservative extension rather than outright inconsistency. A question about the relation of this extension and a differently described (though possibly identical) logic intermediate between BCI and BCK is raised in a final section, which closes with (...) a handful of questions left unanswered by our discussion. (shrink)

In “God of the Gaps: A Neglected Reply to God’s Stone Problem”, Jc Beall and A. J. Cotnoir offer a gappy solution to the paradox of (unrestricted) omnipotence that is typified by the classic stone problem. Andrew Tedder and Guillermo Badia, however, have recently argued that this solution could not be extended to a more serious Curry-like version of the paradox. In this paper, we show that such a gappy solution does extend to it.

Consider the following sentence schema:This sentence entails that ϕ.Call a sentence which is obtained from this schema by the substitution of an arbitrary, contingent sentence, s, for ϕ, the sentence CS. Thus, This sentence entails that s.Now ask the following question: Is CS true?One sentence classically entails a second if and only if it is impossible for both the first to be true and the second to be false. Thus ‘Xanthippe is a mother’ entails ‘Xanthippe is female’ if and only (...) if it is impossible for both ‘Xanthippe is a mother’ to be true and ‘Xanthippe is female’ to be false. CS makes a claim about a purported entailment. Thus, CS is true if and only if it is impossible for both the sentence it mentions as entailing a second to be true and the sentence it mentions as being entailed by the first to be false. In other words, CS is true if and only if it is impossible for both CS to be true and s to be false. In yet other words, CS is false if and only if it is possible for both CS to be true and s to be false. (shrink)

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.

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

The paper essentially shows that the paraconsistent logicDR satisfies the depth relevance condition. The systemDR is an extension of the systemDK of [7] and the non-triviality of a dialectical set theory based onDR has been shown in [3]. The depth relevance condition is a strengthened relevance condition, taking the form: If DR- AB thenA andB share a variable at the same depth, where the depth of an occurrence of a subformulaB in a formulaA is roughly the number of nested ''s (...) required to reach the occurrence ofB inA. The method of proof is to show that a model structureM consisting of {M 0 , M1, ..., M}, where theM i s are all characterized by Meyer''s 6-valued matrices (c. f, [2]), satisfies the depth relevance condition. Then, it is shown thatM is a model structure for the systemDR. (shrink)

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

Is there a notion of contradiction—let us call it, for dramatic effect, “absolute”—making all contradictions, so understood, unacceptable also for dialetheists? It is argued in this paper that there is, and that spelling it out brings some theoretical benefits. First it gives us a foothold on undisputed ground in the methodologically difficult debate on dialetheism. Second, we can use it to express, without begging questions, the disagreement between dialetheists and their rivals on the nature of truth. Third, dialetheism has an (...) operator allowing it, against the opinion of many critics, to rule things out and manifest disagreement: for unlike other proposed exclusion-expressing-devices (for instance, the entailment of triviality), the operator used to formulate the notion of absolute contradiction appears to be immune both from crippling expressive limitations and from revenge paradoxes—pending a rigorous nontriviality proof for a formal dialetheic theory including it. (shrink)

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.