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)

Logic: the Basics is an accessible introduction to the core philosophy topic of standard logic. Focussing on traditional Classical Logic the book deals with topics such as mathematical preliminaries, propositional logic, monadic quantified logic, polyadic quantified logic, and English and standard ‘symbolic transitions’. With exercises and sample answers throughout this thoroughly revised new edition not only comprehensively covers the core topics at introductory level but also gives the reader an idea of how they can take their knowledge further and the (...) philosophical questions around logic. -/- Logic: the Basics is essential reading for first-year undergraduate philosophy students on standard introductory logic courses. (shrink)

The naive theory of properties states that for every condition there is a property instantiated by exactly the things which satisfy that condition. The naive theory of properties is inconsistent in classical logic, but there are many ways to obtain consistent naive theories of properties in nonclassical logics. The naive theory of classes adds to the naive theory of properties an extensionality rule or axiom, which states roughly that if two classes have exactly the same members, they are identical. In (...) this paper we examine the prospects for obtaining a satisfactory naive theory of classes. We start from a result by Ross Brady, which demonstrates the consistency of something resembling a naive theory of classes. We generalize Brady’s result somewhat and extend it to a recent system developed by Andrew Bacon. All of the theories we prove consistent contain an extensionality rule or axiom. But we argue that given the background logics, the relevant extensionality principles are too weak. For example, in some of these theories, there are universal classes which are not declared coextensive. We elucidate some very modest demands on extensionality, designed to rule out this kind of pathology. But we close by proving that even these modest demands cannot be jointly satisfied. In light of this new impossibility result, the prospects for a naive theory of classes are bleak. (shrink)

The main aim is to extend the range of logics which solve the set-theoretic paradoxes, over and above what was achieved by earlier work in the area. In doing this, the paper also provides a link between metacomplete logics and those that solve the paradoxes, by finally establishing that all M1-metacomplete logics can be used as a basis for naive set theory. In doing so, we manage to reach logics that are very close in their axiomatization to that of the (...) logic R of relevant implication. A further aim is the use of metavaluations in a new context, expanding the range of application of this novel technique, already used in the context of negation and arithmetic, thus providing an alternative to traditional model theoretic approaches. (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.

A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on paraconsistent logical systems to change (...) this situation. The book includes almost every major author currently working in the field. The papers are on the cutting edge of the literature some of which discuss current debates and others present important new ideas. The editors have avoided papers about technical details of paraconsistent logic, but instead concentrated upon works that discuss more 'big picture' ideas. Different treatments of paradoxes takes centre stage in many of the papers, but also there are several papers on how to interpret paraconistent logic and some on how it can be applied to philosophy of mathematics, the philosophy of language, and metaphysics. (shrink)

A dialetheia is a sentence, A, such that both it and its negation, A, are true (we shall talk of sentences throughout this entry; but one could run the definition in terms of propositions, statements, or whatever one takes as her favourite truth bearer: this would make little difference in the context). Assuming the fairly uncontroversial view that falsity just is the truth of negation, it can equally be claimed that a dialetheia is a sentence which is both true and (...) false. (shrink)

Tim Maudlin’s Truth and Paradox is terrific. In some sense its solution to the paradoxes is familiar—the book advocates an extension of what’s called the Kripke-Feferman theory (although the definition of validity it employs disguises this fact). Nonetheless, the perspective it casts on that solution is completely novel, and Maudlin uses this perspective to try to make the prima facie unattractive features of this solution seem palatable, indeed inescapable. Moreover, the book deals with many important issues that most writers on (...) the paradoxes never deal with, including issues about the application of the Gödel theorems to powerful theories that include our theory of truth. The book includes intriguing excursions into general metaphysics, e.g. on the nature of logic, facts, vagueness, and much more; and it’s lucid and lively, a pleasure to read. It will interest a wide range of philosophers. (shrink)

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (shrink)

The semantic paradoxes are a family of arguments – including the liar paradox, Curry’s paradox, Grelling’s paradox of heterologicality, Richard’s and Berry’s paradoxes of definability, and others – which have two things in common: first, they make an essential use of such semantic concepts as those of truth, satisfaction, reference, definition, etc.; second, they seem to be very good arguments until we see that their conclusions are contradictory or absurd. These arguments raise serious doubts concerning the coherence of the concepts (...) involved. This article will offer an introduction to some of the main theories that have been proposed to solve the paradoxes and avert those doubts. Included is also a brief history of the semantic paradoxes from Eubulides to Tarski and Curry. (shrink)

This paper raises the question under what circumstances a plurality forms a set, parallel to the Special Composition Question for mereology. The range of answers that have been proposed in the literature are surveyed and criticised. I argue that there is good reason to reject both the view that pluralities never form sets and the view that pluralities always form sets. Instead, we need to affirm restricted set formation. Casting doubt on the availability of any informative principle which will settle (...) which pluralities form sets, the paper concludes by affirming a naturalistic approach to the philosophy of set theory. (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)

The paper offers a solution to the semantic paradoxes, one in which (1) we keep the unrestricted truth schema “True(A)↔A”, and (2) the object language can include its own metalanguage. Because of the first feature, classical logic must be restricted, but full classical reasoning applies in “ordinary” contexts, including standard set theory. The more general logic that replaces classical logic includes a principle of substitutivity of equivalents, which with the truth schema leads to the general intersubstitutivity of True(A) with A (...) within the language.The logic is also shown to have the resources required to represent the way in which sentences (like the Liar sentence and the Curry sentence) that lead to paradox in classical logic are “defective”. We can in fact define a hierarchy of “defectiveness” predicates within the language. Contrary to claims that any solution to the paradoxes just breeds further paradoxes (“revenge problems”) involving defectiveness predicates, there is a general consistency/conservativeness proof that shows that talk of truth and the various “levels of defectiveness” can all be made coherent together within a single object language. (shrink)

The paper shows how we can add a truth predicate to arithmetic (or formalized syntactic theory), and keep the usual truth schema Tr( ) ↔ A (understood as the conjunction of Tr( ) → A and A → Tr( )). We also keep the full intersubstitutivity of Tr(>A>)) with A in all contexts, even inside of an →. Keeping these things requires a weakening of classical logic; I suggest a logic based on the strong Kleene truth tables, but with → (...) as an additional connective, and where the effect of classical logic is preserved in the arithmetic or formal syntax itself. Section 1 is an introduction to the problem and some of the difficulties that must be faced, in particular as to the logic of the →; Section 2 gives a construction of an arithmetically standard model of a truth theory; Section 3 investigates the logical laws that result from this; and Section 4 provides some philosophical commentary. (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 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)

This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. An (...) overview over various ways to formulate Leibniz’s law in non-classical logics and two new triviality proofs for naïve set theory are also provided. (shrink)

This paper describes a modal conception of sets, according to which sets are 'potential' with respect to their members. A modal theory is developed, which invokes a naive comprehension axiom schema, modified by adding `forward looking' and `backward looking' modal operators. We show that this `bi-modal' naive set theory can prove modalized interpretations of several ZFC axioms, including the axiom of infinity. We also show that the theory is consistent by providing an S5 Kripke model. The paper concludes with some (...) discussion of the nature of the modalities involved, drawing comparisons with noneism, the view that there are some non-existent objects. (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)

A dialetheia is a sentence, A, such that both it and its negation, ¬A, are true (we shall talk of sentences throughout this entry; but one could run the definition in terms of propositions, statements, or whatever one takes as her favourite truth-bearer: this would make little difference in the context). Assuming the fairly uncontroversial view that falsity just is the truth of negation, it can equally be claimed that a dialetheia is a sentence which is both true and false.

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)

ABSTRACT In ‘Properties, Propositions, and Conditionals’ Field [2021] advances further on our understanding of the logic and meaning of naive theories – theories that maintain, in the face of paradox, basic assumptions about properties and propositions. His work follows in a tradition going back over 40 years now, of using Kripke fixed-point model constructions to show how naive schemas can be (Post) consistent, as long as one embeds in a non-classical logic. A main issue in all this research is the (...) question of finding a suitable conditional for the naive schemas, an implication connective that is well-behaved enough to be useful but weak enough to maintain coherence when there are paradoxes in the surrounding aether. Field takes several cues from the exemplary work of Ross Brady. Brady's work is predominantly concerned with models for naive theories in relevant logic. Field's considered view is that ‘relevant conditionals are just the wrong tool for naive theories’ [ibid.: 140]. In this note, I reply that a relevant conditional is an indispensable tool for at least one very important job: giving identity conditions for properties. (shrink)

This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.

In a recent series of papers, I and others have advanced new logical approaches to familiar paradoxes. The key to these approaches is to accept full classical logic, and to accept the principles that cause paradox, while preventing trouble by allowing a certain sort ofnontransitivity. Earlier papers have treated paradoxes of truth and vagueness. The present paper will begin to extend the approach to deal with the familiar paradoxes arising in naive set theory, pointing out some of the promises and (...) pitfalls of such an approach. (shrink)

Quantum set theory and topos quantum theory are two long running projects in the mathematical foundations of quantum mechanics that share a great deal of conceptual and technical affinity. Most pertinently, both approaches attempt to resolve some of the conceptual difficulties surrounding QM by reformulating parts of the theory inside of nonclassical mathematical universes, albeit with very different internal logics. We call such mathematical universes, together with those mathematical and logical structures within them that are pertinent to the physical interpretation, (...) ‘Q-worlds’. Here, we provide a unifying framework that allows us to better understand the relationship between different Q-worlds, and define a general method for transferring concepts and results between TQT and QST, thereby significantly increasing the expressive power of both approaches. Along the way, we develop a novel connection to paraconsistent logic and introduce a new class of structures that have significant implications for recent work on paraconsistent set theory. (shrink)

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)

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)

There is a vibrant community among philosophical logicians seeking to resolve the paradoxes of classes, properties and truth by way of adopting some non-classical logic in which trivialising paradoxical arguments are not valid. There is also a long tradition in theoretical computer science|going back to Dana Scott's fixed point model construction for the untyped lambda-calculus of models allowing for fixed points. In this paper, I will bring these traditions closer together, to show how these model constructions can shed light on (...) what we could hope for in a non-trivial model of a theory for classes, properties or truth featuring fixed points. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

Kripke’s theory of truth, 690–716; 1975) has been very successful but shows well-known expressive difficulties; recently, Field has proposed to overcome them by adding a new conditional connective to it. In Field’s theories, desirable conditional and truth-theoretic principles are validated that Kripke’s theory does not yield. Some authors, however, are dissatisfied with certain aspects of Field’s theories, in particular the high complexity. I analyze Field’s models and pin down some reasons for discontent with them, focusing on the meaning of the (...) new conditional and on the status of the principles so successfully recovered. Subsequently, I develop a semantics that improves on Kripke’s theory following Field’s program of adding a conditional to it, using some inductive constructions that include Kripke’s one and feature a strong evaluation for conditionals. The new theory overcomes several problems of Kripke’s one and, although weaker than Field’s proposals, it avoids the difficulties that affect them; at the same time, the new theory turns out to be quite simple. Moreover, the new construction can be used to model various conceptions of what a conditional connective is, in ways that are precluded to both Kripke’s and Field’s theories. (shrink)

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.

The study of truth is often seen as running on two separate paths: the nature path and the logic path. The former concerns metaphysical questions about the ‘nature’, if any, of truth. The latter concerns itself largely with logic, particularly logical issues arising from the truth-theoretic paradoxes. Where, if at all, do these two paths meet? It may seem, and it is all too often assumed, that they do not meet, or at best touch in only incidental ways. It is (...) often assumed that work on the metaphysics of truth need not pay much attention to issues of paradox and logic; and it is likewise assumed that work on paradox is independent of the larger issues of metaphysics. Philosophical work on truth often includes a footnote anticipating some resolution of the paradox, but otherwise tends to take no note of it. Likewise, logical work on truth tends to have little to say about metaphysical presuppositions, and simply articulates formal theories, whose strength may be measured, and whose properties may be discussed. In practice, the paths go their own ways. Our aim in this paper is somewhat modest. We seek to illustrate one point of intersection between the paths. Even so, our aim is not completely modest, as the point of intersection is a notable one that often goes unnoticed. We argue that the ‘nature’ path impacts the logic path in a fairly direct way. What one can and must say about the logic of truth is influenced, or even in some cases determined, by what one says about the metaphysical nature of truth. In particular, when it comes to saying what the well-known Liar paradox teaches us about truth, background conceptions — views on ‘nature’ — play a significant role in constraining what can be said. This paper, in rough outline, first sets out some representative ‘nature’ views, followed by the ‘logic’ issues (viz., paradox), and turns to responses to the Liar paradox. What we hope to illustrate is the fairly direct way in which the background ‘nature’ views constrain — if not dictate — responses to the main problem on the ‘logic’ path.. (shrink)

A crucial question here is what, exactly, the conditional in the naive truth/set comprehension principles is. In 'Logic of Paradox', I outlined two options. One is to take it to be the material conditional of the extensional paraconsistent logic LP. Call this "Strategy 1". LP is a relatively weak logic, however. In particular, the material conditional does not detach. The other strategy is to take it to be some detachable conditional. Call this "Strategy 2". The aim of the present essay (...) is to investigate Stragey 1. It is not to advocate it. The work is simply an extended exploration of the strategy, its strengths, its weaknesses, and the various dierent ways in which it may be implemented. In the first part of the paper I will set up the appropriate background details. In the second, I will look at the strategy as it applies to the semantic paradoxes. In the third I will look at how it applies to the set-theoretic paradoxes. (shrink)

After indicating why this is needed, the paper proves a non-triviality result for paraconsistent theory containing arithmetic, naive truth and denotation predicates, and descriptions. The result is obtained by dualising a construction of Kroon. Its most notable feature is that there is a trivial object- one that has every property.

Priest argued in Fusion and Confusion (Priest in Topoi 34(1):55–61, 2015a) for a new concept of logical consequence over the relevant logic B, one where premises my be “confused” together. This paper develops Priest’s idea. Whereas Priest uses a substructural proof calculus, this paper provides a Hilbert proof calculus for it. Using this it is shown that Priest’s consequence relation is weaker than the standard Hilbert consequence relation for B, but strictly stronger than Anderson and Belnap’s original relevant notion of (...) consequence. Unlike the latter, however, Priest’s consequence relation does not satisfy a variant of the variable sharing property. This paper shows that how it can be modified so as to do so. Priest’s consequence relation turns out to be surprisingly weak in some respects. The prospects of strengthening it is raised and discussed in a broader philosophical context. (shrink)