This paper defends a reading of Wittgenstein’s philosophy of mathematics in the Lectures on the Foundation of Mathematics as a radical conventionalist one, whereby our agreement about the particular case is constitutive of our mathematical practice and ‘the logical necessity of any statement is a direct expression of a convention’ (Dummett 1959, p. 329). -/- On this view, mathematical truths are conceptual truths and our practices determine directly for each mathematical proposition individually whether it is true or false. Mathematical truths (...) are thus not consequences of a prior adoption of a convention or rules as orthodox conventionalism has it. -/- The goal of the paper is not merely exegetical, however, and argues that radical conventionalism can withstand some of the most difficult objections that have been brought forward against it, including those of Dummett himself, and thus that radical conventionalism has been prematurely excluded from consideration by philosophers of mathematics. (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)

No one will dispute, looking at the history of mathematics, that there are plenty of moments where mathematics is “in trouble”, when paradoxes and inconsistencies crop up and anomalies multiply. This need not lead, however, to the view that mathematics is intrinsically inconsistent, as it is compatible with the view that these are just transient moments. Once the problems are resolved, consistency (in some sense or other) is restored. Even when one accepts this view, what remains is the question what (...) mathematicians do during such a transient moment? This requires some method or other to reason with inconsistencies. But there is more: what if one accepts the view that mathematics is always in a phase of transience? In short, that mathematics is basically inconsistent? Do we then not need a mathematics of inconsistency? This paper wants to explore these issues, using classic examples such as infinitesimals, complex numbers, and infinity. (shrink)

The collapse models of arithmetic are inconsistent, nontrivial models obtained from ℕ and set out in the Logic of Paradox (LP). They are given a general treatment by Priest (Priest, 2000). Finite collapse models are decidable, and thus axiomatizable, because finite. LP, however, is ill-suited to normal axiomatic reasoning, as it invalidates Modus Ponens, and almost all other usual conditional inferences. I set out a logic, A3, first given by Avron (Avron, 1991), and give a first order axiom system for (...) the finite collapse models. I present some standard arithmetical axioms in addition to a cyclic axiom and prove that these axioms are sound and complete for the cyclic models, reporting a similar result for the heap models. The state of the situation for the each of the kinds of infinite collapse model is, however, left an open question. (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)

As far as disputes in the philosophy of pure mathematics goes, these are usually between classical mathematics, intuitionist mathematics, paraconsistent mathematics, and so on. My own view is that of a mathematical pluralist: all these different kinds of mathematics are equally legitimate. Applied mathematics is a different matter. In this, a piece of pure mathematics is applied in an empirical area, such as physics, biology, or economics. There can then certainly be a disputes about what the correct pure mathematics to (...) apply is. Such disputes may be settled by the standard criteria of scientific theory selection (adequacy of empirical predications, simplicity, etc.) But what, exactly is it to apply a piece of pure mathematics? How is mathematics applied? By and large, philosophers of mathematics have cared more about pure mathematics than applied mathematics, and not a lot of thought has gone into this question. In this paper I will address the issue and some of its implications. (shrink)

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.

The question of the interpretation of impossible pictures is taken up. Penrose's account is reviewed. It is argued that whereas this account makes substantial inroads into the problem, there needs to be a further ingredient. An inconsistent account using heap models is proposed.

In this paper, I offer a close reading of Wittgenstein's remarks on inconsistency, mostly as they appear in the Lectures on the Foundations of Mathematics. I focus especially on an objection to Wittgenstein's view given by Alan Turing, who attended the lectures, the so-called ‘falling bridges’-objection. Wittgenstein's position is that if contradictions arise in some practice of language, they are not necessarily fatal to that practice nor necessitate a revision of that practice. If we then assume that we have adopted (...) a paraconsistent logic, Wittgenstein's answer to Turing is that if we run into trouble building our bridge, it is either because we have made a calculation mistake or our calculus does not actually describe the phenomenon it is intended to model. The possibility of either kind of error is not particular to contradictions nor inconsistency, and thus contradictions do not have any special status as a thing to be avoided. (shrink)

The phenomenological movement begins in the Prolegomena to Husserl’s Logical Investigations as a philosophy of logic. Despite this, remarkably little attention has been paid to Husserl’s arguments in the Prolegomena in the contemporary philosophy of logic. In particular, the literature spawned by Gilbert Harman’s work on the normative status of logic is almost silent on Husserl’s contribution to this topic. I begin by raising a worry for Husserl’s conception of ‘pure logic’ similar to Harman’s challenge to explain the connection between (...) logic and reasoning. If logic is the study of the forms of all possible theories, it will include the study of many logical consequence relations; by what criteria, then, should we select one consequence relation as correct? I consider how Husserl might respond to this worry by looking to his late account of the ‘genealogy of logic’ in connection with Gurwitsch’s claim that ‘[i]t is to prepredicative perceptual experience … that one must return for a radical clarification and for the definitive justification of logic’. Drawing also on Sartre and Heidegger, I consider how prepredicative experience might constrain or guide our selection of a logical consequence relation and our understanding of connectives like implication and negation. (shrink)

Pluralist mathematical realism, the view that there exists more than one mathematical universe, has become an influential position in the philosophy of mathematics. I argue that, if mathematical pluralism is true (and we have good reason to believe that it is), then mathematical realism cannot (easily) be justified by arguments from the indispensability of mathematics to science. This is because any justificatory chain of inferences from mathematical applications in science to the total body of mathematical theorems can cover at most (...) one mathematical universe. Indispensability arguments may thus lose their central role in the debate about mathematical ontology. (shrink)

The logic of paradox, LP, is a first-order, three-valued logic that has been advocated by Graham Priest as an appropriate way to represent the possibility of acceptable contradictory statements. Second-order LP is that logic augmented with quantification over predicates. As with classical second-order logic, there are different ways to give the semantic interpretation of sentences of the logic. The different ways give rise to different logical advantages and disadvantages, and we canvass several of these, concluding that it will be extremely (...) difficult to appeal to second-order LP for the purposes that its proponents advocate, until some deep, intricate, and hitherto unarticulated metaphysical advances are made. (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)

J. Michael Dunn’s Theorem in 3-Valued Model Theory and Graham Priest’s Collapsing Lemma provide the means of constructing first-order, three-valued structures from classical models while preserving some control over the theories of the ensuing models. The present article introduces a general construction that we call a Dunn–Priest quotient, providing a more general means of constructing models for arbitrary many-valued, first-order logical systems from models of any second system. This technique not only counts Dunn’s and Priest’s techniques as special cases, but (...) also provides a generalized Collapsing Lemma for Priest’s more recent plurivalent semantics in general. We examine when and how much control may be exerted over the resulting theories in particular cases. Finally, we expand the utility of the construction by showing that taking Dunn–Priest quotients of a family of structures commutes with taking an ultraproduct of that family, increasing the versatility of the tool. (shrink)

In this paper I’ll explore the relation between ω-inconsistency and plain inconsistency, in the context of theories that intend to capture semantic concepts. In particular, I’ll focus on two very well known inconsistent but non-trivial theories of truth: LP and STTT. Both have the interesting feature of being able to handle semantic and arithmetic concepts, maintaining the standard model. However, it can be easily shown that both theories are ω- inconsistent. Although usually a theory of truth is generally expected to (...) be ω-consistent, all conceptual concerns don’t apply to inconsistent theories. Finally, I’ll explore if it’s possible to have an inconsistent, butω-consistent theory of truth, restricting my analysis to substructural theories. (shrink)

In this paper I present an argument for belief in inconsistent objects. The argument relies on a particular, plausible version of scientific realism, and the fact that often our best scientific theories are inconsistent. It is not clear what to make of this argument. Is it a reductio of the version of scientific realism under consideration? If it is, what are the alternatives? Should we just accept the conclusion? I will argue (rather tentatively and suitably qualified) for a positive answer (...) to the last question: there are times when it is legitimate to believe in inconsistent objects. (shrink)

The present paper focuses on Graham Priest’s claim that even primitive recursive relations may be inconsistent. Although he carefully presented his claim using the expression “may be,” Priest made a definite claim that even numerical equations can be inconsistent. His argument relies heavily on the fact that there is an inconsistent model for arithmetic. After summarizing Priest’s argument for the inconsistent primitive recursive relation, I first discuss the fact that his argument has a weak foundation to explain that the existence (...) of a model for some relations does not guarantee that they are primitive recursive. Moreover, since his identity relation is a combination of a standard identity and a congruence relation, it does not simply represent the standard identity function. Then, I argue that his identity relation cannot be both inconsistent and primitive recursive. Furthermore, I extend the argument to the general case that there is no inconsistent primitive recursive relation. These arguments show that the standard notions of “function” and “primitive recursive function” do not fit Priest’s inconsistent model. New definitions are necessary to show the existence of a dialetheic primitive recursive relation. (shrink)

Guided by questions of scope, this paper provides an overview of what is known about both the scope and, consequently, the limits of Gödel’s famous first incompleteness theorem.

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)

Elimination of quantifiers is shown to fail dramatically for a group of well‐known mathematical theories (classically enjoying the property) against a wide range of relevant logical backgrounds. Furthermore, it is suggested that only by moving to more extensional underlying logics can we get the property back.

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)

This paper explores early Australasian philosophy in some detail. Two approaches have dominated Western philosophy in Australia: idealism and materialism. Idealism was prevalent between the 1880s and the 1930s, but dissipated thereafter. Idealism in Australia often reflected Kantian themes, but it also reflected the revival of interest in Hegel through the work of ‘absolute idealists’ such as T. H. Green, F. H. Bradley, and Henry Jones. A number of the early New Zealand philosophers were also educated in the idealist tradition (...) and were influential in their communities, but produced relatively little. In Australia, materialism gained prominence through the work of John Anderson, who arrived in Australia in 1927, and continues to be influential. John Anderson had been a student of Henry Jones, who might therefore be said to have influenced both main strands of Australian philosophical thought. (shrink)

Dialetheism is the view that there exists a true contradiction. This paper ventures to suggest that Priest’s argument for Dialetheism from Gödel’s theorem is unconvincing as the lesson of Gödel’s proof (or Rosser’s proof) is that any sufficiently strong theories of arithmetic cannot be both complete and consistent. In addition, a contradiction is derivable in Priest’s inconsistent and complete arithmetic. An alternative argument for Dialetheism is given by applying Gödel sentence to the inconsistent and complete theory of arithmetic. We argue, (...) however, that the alternative argument raises a circularity problem. In sum, Gödel’s and its related theorem merely show the relation between a complete and a consistent theory. A contradiction derived by the application of Gödel sentence has the value of true sentences, i.e. the both-value, only under the inconsistent models for arithmetic. Without having the assumption of inconsistency or completeness, a true contradiction is not derivable from the application of Gödel sentence. Hence, Gödel’s and its related theorem never can be a ground for Dialetheism. (shrink)