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 rationals, or of any other order type that can be embedded in the rationals in a certain way. (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)

The paper concerns interpretations of the paraconsistent logic LP which model theories properly containing all the sentences of first order arithmetic. The paper demonstrates the existence of such models and provides a complete taxonomy of the finite ones.

We answer some problems set by Priest in [11] and [12], in particular refuting Priest's Conjecture that all LP-models of Th(N) essentially arise via congruence relations on classical models of Th(N). We also show that the analogue of Priest's Conjecture for I δ₀ + Exp implies the existence of truth definitions for intervals [0,a] ⊂ₑ M ⊨ I δ₀ + Exp in any cut [0,a] ⊂e K ⊆ M closed under successor and multiplication.

We give a complete characterization of Priest's Finite Inconsistent Arithmetics observing that his original putative characterization included arithmetics which cannot in fact be realized.

This paper develops in certain directions the work of Meyer in [3], [4], [5] and [6]. In those works, Peano’s axioms for arithmetic were formulated with a logical base of the relevant logic R, and it was proved finitistically that the resulting arithmetic, called R♯, was absolutely consistent. It was pointed out that such a result escapes incau- tious formulations of Goedel’s second incompleteness theorem, and provides a basis for a revived Hilbert programme. The absolute consistency result used as a (...) model arithmetic modulo two. Modulo arithmetics are not or- dinarily thought of as an extension of Peano arithmetic, since some of the propositions of the latter, such as that zero is the successor of no number, fail in the former. Consequently a logical base which, unlike classical logic, tolerates contradictory theories was used for the model. The logical base for the model was the three-valued logic RM3, which has the advantage that while it is an extension of R, it is finite valued and so easier to handle. The resulting model-theoretic structure is interesting in its own right in that the set of sentences true therein consti- tutes a negation inconsistent but absolutely consistent arithmetic which is an extension of R♯. In fact, in the light of the result of [6], it is an extension of Peano arithmetic with a base of a classical logic, P♯. A generalisation of the structure is to modulo arithmetics with the same logical base RM3, but with varying moduli. We first study the properties of these arithmetics in this paper. The study is then generalised by vary- ing the logical base, to give the arithmetics RMni, of logical base RMn and modulus i. Not all of these exist, however, as arithmetical properties and logical properties interact, as we will show. The arithmetics RMni give rise, on intersection, to an inconsistent arithmetic RMω which is not of modulo i for any i. We also study its properties, and, among other results, we show by finitistic means that the more natural relevant arithmetics R♯ and R♯♯ are incomplete. In the rest of the paper we apply these techniques to several topics, particularly relevant quantum arithmetic in which we are able to show that the law of distribution remains unprovable. Aside from its intrinsic interest, we regard the present exercise as a demonstration that inconsistent theories and models are of mathematical worth and interest. (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.

Based on the relevant logic R, the system R# was proposed as a relevant Peano arithmetic. R# has many nice properties: the most conspicuous theorems of classical Peano arithmetic PA are readily provable therein; it is readily and effectively shown to be nontrivial; it incorporates both intuitionist and classical proof methods. But it is shown here that R# is properly weaker than PA, in the sense that there is a strictly positive theorem QRF of PA which is unprovable in R#. (...) The reason is interesting: if PA is slightly weakened to a subtheory P+, it admits the complex ring C as a model; thus QRF is chosen to be a theorem of PA but false in C. Inasmuch as all strictly positive theorems of R# are already theorems of P+, this nonconservativity result shows that QRF is also a nontheorem of R#. As a consequence, Ackermann's rule γ is inadmissible in R#. Accordingly, an extension of R# which retains its good features is desired. The system R##, got by adding an omega-rule, is such an extension. Central question: is there an effectively axiomatizable system intermediate between R# and R##, which does formalize arithmetic on relevant principles, but also admits γ in a natural way? (shrink)

We here make preliminary investigations into the model theory of DeMorgan logics. We demonstrate that Łoś's Theorem holds with respect to these logics and make some remarks about standard model-theoretic properties in such contexts. More concretely, as a case study we examine the fate of Cantor's Theorem that the classical theory of dense linear orderings without endpoints is $\aleph_{0}$-categorical, and we show that the taking of ultraproducts commutes with respect to previously established methods of constructing nonclassical structures, namely, Priest's Collapsing (...) Lemma and Dunn's Theorem in 3-Valued Logic. (shrink)

From classical, Fraïissé-homogeneous, ($\leq \omega$)-categorical theories over finite relational languages, we construct intuitionistic theories that are complete, prove negations of classical tautologies, and admit quantifier elimination. We also determine the intuitionistic universal fragments of these theories.

The quantified relevant logic RQ is given a new semantics in which a formula for all xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of 'extensional confinement': for all x(A V (...) B) -> (A V for all xB). with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation. (shrink)

In the early seventies, several logicians developed a semantics for propositional systems of relevance logic. The essential ingredients of this semantics were a privileged point o, an ‘accessibility’ relation R and a special operator * for evaluating negation. Under the truth- conditions of the semantics, each formula A(Pl,…,Pn) could be seen as expressing a first order condition A+(pl,…,pn, o, R,*) on sets p1,…,pn and o, R, *, while each formula-scheme could be regarded as expressing the second-order condition ∀p1,…,∀pn A+(p1,…,pn, o, (...) R, *). It could then be shown that many standard systems of propositional relevance logic were complete in the sense that their theorems were just those formulas true in all models whose components o, R and * conformed to the second-order conditions expressed by the axioms of the system. (shrink)