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)

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)

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)

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)

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.

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)

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)

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 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)

This paper is about the concept of semantically closed languages. Roughly speaking, those are languages which can name their own sentences and apply to them semantic predicates, such as the truth or satisfaction predicates. Hence, they are “self-referential languages,” in the sense that they are capable of producing sentences about themselves or other sentences in the same language. In section one, we introduce the concept informally; in section two, we provide the formal definition of first-order semantically closed languages, which is (...) the Tarskian definition with some technical modifications. Then, we construct a semantic for this kind of language, and prove that the language is indeed semantically closed (according to Definition 1). Finally, we discuss whether the logic underlying the construction is classical, and future goals of this research. (shrink)