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)
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.
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.
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 considers a generalisation of the sorites paradox, in which only topological notions are employed. We argue that by increasing the level of abstraction in this way, we see the sorites paradox in a new, more revealing light—a light that forces attention on cut-off points of vague predicates. The generalised sorites paradox presented here also gives rise to a new, more tractable definition of vagueness.
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 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.
Mereotopology is a theory of connected parts. The existence of boundaries, as parts of everyday objects, is basic to any such theory; but in classical mereotopology, there is a problem: if boundaries exist, then either distinct entities cannot be in contact, or else space is not topologically connected . In this paper we urge that this problem can be met with a paraconsistent mereotopology, and sketch the details of one such approach. The resulting theory focuses attention on the role of (...) empty parts, in delivering a balanced and bounded metaphysics of naive space. (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 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)
Standard reasoning about Kripke semantics for modal logic is almost always based on a background framework of classical logic. Can proofs for familiar definability theorems be carried out using a nonclassical substructural logic as the metatheory? This article presents a semantics for positive substructural modal logic and studies the connection between frame conditions and formulas, via definability theorems. The novelty is that all the proofs are carried out with a noncontractive logic in the background. This sheds light on which modal (...) principles are invariant under changes of metalogic, and provides evidence for the general viability of nonclassical mathematics. (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.
ABSTRACTIn ‘Theism and Dialetheism’, Cotnoir explores the idea that dialetheism can help with some puzzles about omnipotence in theology. In this note, I delineate another asp...
Even if you were the last person on Earth, you should not cut down all the trees—or so goes the Last Man thought experiment, which has been taken to show that nature has intrinsic value. But ‘Last Man’ is caught on a dilemma. If Last Man is too far inside the anthropocentric circle, so to speak, his actions cannot be indicative of intrinsic value. If Last Man is cast too far outside the anthropocentric circle, though, then value terms lose their (...) cogency. The experiment must satisfy conditions in a seemingly impossible ‘goldilocks’ zone. To this end I propose a new version, the Ultramodal Last Man, which appeals to Routley's work in metaphysics and non-classical logic. With this ‘Last Last Man’, I argue that the Local/Global dilemma is resolved: impossible equations balance in ultramodal space. For defenders and critics alike, this helps to clarify the demands of intrinsic value, and renews a role for non-standard logics in value theory. (shrink)
A world is trivial if it makes every proposition true all at once. Such a world is impossible, an absurdity. Our world, we hope, is not an absurdity. It is important, nevertheless, for semantic and metaphysical theories that we be able to reason cogently about absurdities—if only to see that they are absurd. In this note we describe methods for ‘observing’ absurd objects like the trivial world without falling in to incoherence, using some basic techniques from modal logic. The goal (...) is to begin to locate the trivial world’s relative position in modal space; the outcome is that the less we assume about relative possibility, the more detail we can discern at the edge of reason. (shrink)
The inclosure schema has been proposed by Priest as the structure of many paradoxes. The inclosure analysis has many virtues, especially as a step toward a uniform solution to the paradoxes. Inclosure suggests that paradoxes arise at the limits of thought because the limits can be surpassed, and also not; and so dialetheism is true. I explore the consequences of accepting Priest’s proposal. From a thoroughly dialetheic perspective, then, I find that the import of inclosure changes: some limit phenomena cannot (...) be contradictory, on pain of absurdity, and true contradictions are better thought of as local, not “limit” phenomena. Dialetheism leads back from the edge of thought, to the inconsistent in the every day. (shrink)
In a recent article, Emil Badici contends that the inclosure schema substantially fails as an analysis of the paradoxes of self-reference because it is question-begging. The main purpose of this note is to show that Badici's critique highlights a necessity condition for the success of dialectic about paradoxes. The inclosure argument respects this condition and remains solvent.
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)
Even if you were the last person on Earth, you should not cut down all the trees—or so goes the Last Man thought experiment, which has been taken to show that nature has intrinsic value. But ‘Last Man’ is caught on a dilemma. If Last Man is too far inside the anthropocentric circle, so to speak, his actions cannot be indicative of intrinsic value. If Last Man is cast too far outside the anthropocentric circle, though, then value terms lose their (...) cogency. The experiment must satisfy conditions in a seemingly impossible ‘goldilocks’ zone. To this end I propose a new version, the Ultramodal Last Man, which appeals to Routley's work in metaphysics and non-classical logic. With this ‘Last Last Man’, I argue that the Local/Global dilemma is resolved: impossible equations balance in ultramodal space. For defenders and critics alike, this helps to clarify the demands of intrinsic value, and renews a role for non-standard logics in value theory. (shrink)
This article suggests a novel way to advance a current debate in the philosophy of mathematics. The debate concerns the role of diagrams and visual reasoning in proofs—which I take to concern the criteria of legitimate representation of mathematical thought. Drawing on the so-called ‘maverick’ approach to philosophy of mathematics, I turn to mathematical practice itself to adjudicate in this debate, and in particular to category theory, because there (a) diagrams obviously play a major role, and (b) category theory itself (...) addresses questions of representation and information preservation over mappings. We obtain a mathematical answer to a philosophical question: a good mathematical representation can be characterized as a category theoretic natural transformation. (shrink)
Logical paradoxes – like the Liar, Russell's, and the Sorites – are notorious. But in Paradoxes and Inconsistent Mathematics, it is argued that they are only the noisiest of many. Contradictions arise in the everyday, from the smallest points to the widest boundaries. In this book, Zach Weber uses “dialetheic paraconsistency” – a formal framework where some contradictions can be true without absurdity – as the basis for developing this idea rigorously, from mathematical foundations up. In doing so, Weber directly (...) addresses a longstanding open question: how much standard mathematics can paraconsistency capture? The guiding focus is on a more basic question, of why there are paradoxes. Details underscore a simple philosophical claim: that paradoxes are found in the ordinary, and that is what makes them so extraordinary. (shrink)
A theorem from Archimedes on the area of a circle is proved in a setting where some inconsistency is permissible, by using paraconsistent reasoning. The new proof emphasizes that the famous method of exhaustion gives approximations of areas closer than any consistent quantity. This is equivalent to the classical theorem in a classical context, but not in a context where it is possible that there are inconsistent innitesimals. The area of the circle is taken 'up to inconsistency'. The fact that (...) the core of Archimedes's proof still works in a weaker logic is evidence that the integral calculus and analysis more generally are still practicable even in the event of inconsistency. (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 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)
