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)

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)

Vague predicates, on a paraconsistent account, admit overdetermined borderline cases. I take up a new line on the paraconsistent approach, to show that there is a close structural relationship between the breakdown of soritical progressions, and contradiction. Accordingly, a formal picture drawn from an appropriate logic shows that any cut-off point of a vague predicate is unidentifiable, in a precise sense. A paraconsistent approach predicts and explains many of the most counterintuitive aspects of vagueness, in terms of a more fundamental (...) inconsistency. (shrink)

From the reviews: "A good textbook can improve a lecture course enormously, especially when the material of the lecture includes many technical details. Van Dalen's book, the success and popularity of which may be suspected from this steady interest in it, contains a thorough introduction to elementary classical logic in a relaxed way, suitable for mathematics students who just want to get to know logic. The presentation always points out the connections of logic to other parts of mathematics. The reader (...) immediately see the logic is "just another branch of mathematics" and not something more sacred." Acta Scientiarum Mathematicarum, Hungary. (shrink)

It is a generally accepted idea that strict finitism is a rather marginal view within the community of philosophers of mathematics. If one therefore wants to defend such a position (as the present author does), then it is useful to search for as many different arguments as possible in support of strict finitism. Sometimes, as will be the case in this paper, the argument consists of, what one might call, a “rearrangement” of known materials. The novelty lies precisely in the (...) rearrangement, hence on the formal-axiomatic level most of the results presented here are not new. In fact, the basic results are inspired by and based on Mycielski (1981). (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)

The paper establishes the general structure of the inconsistent models of arithmetic of [7]. It is shown that such models are constituted by a sequence of nuclei. The nuclei fall into three segments: the first contains improper nuclei: the second contains proper nuclei with linear chromosomes: the third contains proper nuclei with cyclical chromosomes. The nuclei have periods which are inherited up the ordering. It is also shown that the improper nuclei can have the order type of any ordinal. of (...) the nationals. or of any other order type that can be embedded in the rationals in a certain way. (shrink)

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)

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.

One of the standard ways of postulating large cardinal axioms is to consider elementary embeddings,j, from the universe,V, into some transitive submodel,M. See Reinhardt–Solovay [7] for more details. Ifjis not the identity, andκis the first ordinal moved byj, thenκis a measurable cardinal. Conversely, Scott [8] showed that wheneverκis measurable, there is suchjandM. If we had assumed, in addition, that, thenκwould be theκth measurable cardinal; in general, the wider we assumeMto be, the largerκmust be.

The usual objections to infinite numbers, and classes, and series, and the notion that the infinite as such is self-contradictory, may... be dismissed as groundless. There remains, however, a very grave difficulty, connected with the contradiction [of the class of all classes not members of themselves]. This difficulty does not concern the infinite as such, but only certain very large infinite classes.

The paraconsistent system CPQ-ZFC/F is defined. It is shown using strong non-finitary methods that the theorems of CPQ-ZFC/F are exactly the theorems of classical ZFC minus foundation. The proof presented in the paper uses the assumption that a strongly inaccessible cardinal exists. It is then shown using strictly finitary methods that CPQ-ZFC/F is non-trivial. CPQ-ZFC/F thus provides a formulation of set theory that has the same deductive power as the corresponding classical system but is more reliable in that non-triviality is (...) provable by strictly finitary methods. This result does not contradict Gödel's incompleteness theorem because the proof of the deductive equivalence of the paraconsistent and classical systemss use non-finitary methods. (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.

The paper reviews a number of approaches for handling restricted quantification in relevant logic, and proposes a novel one. This proceeds by introducing a novel kind of enthymematic conditional.

In his ‘On t and u and what they can do’, Greg Restall presents an apparent problem for a handful of well-known non-classical solutions to paradoxes like the liar. In this article, we argue that there is a problem only if classical logic – or classical-enough logic – is presupposed. 1. Background Many have thought that invoking non-classical logic – in particular, a paracomplete or paraconsistent logic – is the correct response to the liar and related paradoxes. At the most (...) basic level, the target non-classical idea is that some expressions, like ‘all and only the true propositions’, do not behave as we would expect from classical logic. Non-classical theorists argue that the class of all and only the truths is either incomplete or inconsistent: when you truly speak of all and only truths , you're either leaving some truths out, or you're letting some untruths in. Truth, in a slogan, is either gappy or glutty. Non-classicality is not a glib or easy-way-out response to the paradoxes. Innocuous-seeming notions can turn out to be philosophically substantial. Moreover, apparently correct forms of reasoning can turn out to be incorrect. To take a example, a glut theorist must hold that the following argument form is not in general valid. Either p is true or q is true. But p is untrue. So q is true. This argument form may strike our ears as acceptable. But if p is a truth value glut, then the inference fails to preserve truth. According to glut theorists, the inference breaks down in inconsistent contexts: if the subject matter involves gluts, then the inference is to be rejected. And the liar paradox, according to such theorists, shows that truth is exactly the kind of subject matter that yields inconsistency. In the …. (shrink)

This massive two-volume reference presents a comprehensive selection of the most important works on the foundations of mathematics. While the volumes include important forerunners like Berkeley, MacLaurin, and D'Alembert, as well as such followers as Hilbert and Bourbaki, their emphasis is on the mathematical and philosophical developments of the nineteenth century. Besides reproducing reliable English translations of classics works by Bolzano, Riemann, Hamilton, Dedekind, and Poincare, William Ewald also includes selections from Gauss, Cantor, Kronecker, and Zermelo, all translated here for (...) the first time. (shrink)

Provability, Computability and Reflection.

This third edition, now available in paperback, is a follow up to the author's classic Boolean-Valued Models and Independence Proofs in Set Theory. It provides an exposition of some of the most important results in set theory obtained in the 20th century: the independence of the continuum hypothesis and the axiom of choice.

Throughout the twentieth century, the classical logic of Frege and Russell dominated the field of formal logic. But, as Ross Brady argues, a new type of weak relevant logic may prove to be better equipped to present new solutions to persistent paradoxes. _Universal Logic _begins with an overview of classical and relevant logic and discusses the limitations of both in analyzing certain paradoxes. It is the first text to demonstrate how the main set-theoretic and semantic paradoxes can be solved in (...) a systematic way and as such will be of great interest to both scholars and students of logic. (shrink)

We first consider the entailment logic MC, based on meaning containment, which contains neither the Law of Excluded Middle (LEM) nor the Disjunctive Syllogism (DS). We then argue that the DS may be assumed at least on a similar basis as the assumption of the LEM, which is then justified over a finite domain or for a recursive property over an infinite domain. In the latter case, use is made of Mathematical Induction. We then show that an instance of the (...) LEM is intrumental in the proof of Cantor's Theorem, and we then argue that this is based on a more general form than can be reasonably justified. We briefly consider the impact of our approach on arithmetic and naive set theory, and compare it with intuitionist mathematics and briefly with recursive mathematics. Our "Four Basic Logical Issues" paper would provide useful background, the current paper being an application of the some of the ideas in it. (shrink)