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)

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.

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)

Models are constructed for a variety of systems of quantified relevance logic with identity. Models are given for systems with different principles governing the transitivity of identity and substitution, and the relative merits of these principles are discussed. The models in this paper are all extensions of the semantics of Fine's Semantics for Quantified Relevance Logic (Journal of Philosophical Logic 17 (1988)).

We begin to fill a lacuna in the relevance logic enterprise by providing a foundational analysis of identity in relevance logic. We consider rival interpretations of identity in this context, settling on the relevant indiscernibility interpretation, an interpretation related to Dunn's relevant predication project. We propose a general test for the stability of an axiomatisation of identity, relative to this interpretation, and we put various axiomatisations to this test. We fill our discussion out with both formal and philosophical remarks on (...) identity in relevance logic. (shrink)

Philosophical dialetheism, whose main exponent is Graham Priest, claims that some contradictions hold, are true, and it is rational to accept and assert them. Such a position is naturally portrayed as a challenge to the Law of Non-Contradiction (LNC). But all the classic formulations of the LNC are, in a sense, not questioned by a typical dialetheist, since she is (cheerfully) required to accept them by her own theory. The goal of this paper is to develop a formulation of the (...) Law which appears to be unquestionable, in the sense that the Priestian dialetheist is committed to accept it without also accepting something inconsistent with it, on pain of trivialism—that is to say, on pain of lapsing into the position according to which everything is the case. This will be achieved via (a) a discussion of Priest's dialetheic treatment of the notions of rejection and denial; and (b) the characterization of a negation via the primitive intuition of content exclusion. Such a result will not constitute a cheap victory for the friends of consistency. We may just learn that different things have been historically conflated under the label of 'Law of Non-Contradiction'; that dialetheists rightly attack some formulations of the Law, and orthodox logicians and philosophers have been mistaken in assimilating them to the indisputable one. (shrink)

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 this paper I present a range of substructural logics for a conditional connective ↦. This connective was original introduced semantically via restriction on the ternary accessibility relation R for a relevant conditional. I give sound and complete proof systems for a number of variations of this semantic definition. The completeness result in this paper proceeds by step-by-step improvements of models, rather than by the one-step canonical model method. This gradual technique allows for the additional control, lacking in the canonical (...) model method, that is required. (shrink)