Logical paradoxes – like the Liar, Russell's, and the Sorites – are notorious. But in Paradoxes and Inconsistent Mathematics, it is argued that they are only the noisiest of many. Contradictions arise in the everyday, from the smallest points to the widest boundaries. In this book, Zach Weber uses “dialetheic paraconsistency” – a formal framework where some contradictions can be true without absurdity – as the basis for developing this idea rigorously, from mathematical foundations up. In doing so, (...) Weber directly addresses a longstanding open question: how much standard mathematics can paraconsistency capture? The guiding focus is on a more basic question, of why there are paradoxes. Details underscore a simple philosophical claim: that paradoxes are found in the ordinary, and that is what makes them so extraordinary. (shrink)

At various times, mathematicians have been forced to work with inconsistent mathematical theories. Sometimes the inconsistency of the theory in question was apparent (e.g. the early calculus), while at other times it was not (e.g. pre-paradox na¨ıve set theory). The way mathematicians confronted such difficulties is the subject of a great deal of interesting work in the history of mathematics but, apart from the crisis in set theory, there has been very little philosophical work on the topic of (...) inconsistent mathematics. In this paper I will address a couple of philosophical issues arising from the applications of inconsistent mathematics. The first is the issue of whether finding applications for inconsistent mathematics commits us to the existence of inconsistent objects. I then consider what we can learn about a general philosophical account of the applicability of mathematics from successful applications of inconsistent mathematics. (shrink)

This dissertation has two main goals. The first is to provide a practice-based analysis of the field of inconsistent mathematics: what motivates it? what role does logic have in it? what distinguishes it from classical mathematics? is it alternative or revolutionary? The second goal is to introduce and defend a new conception of inconsistent mathematics - queer incomaths - as a particularly effective answer to feminist critiques of classical logic and mathematics. This sets the (...) stage for a genuine revolution in mathematics, insofar as it suggests the need for a shift in mainstream attitudes about the role of logic and ethics in the practice of mathematics. (shrink)

According to standard accounts of mathematical representations of physical phenomena, positing structure-preserving mappings between a physical target system and the structure picked out by a mathematical theory is essential to such representations. In this paper, I argue that these accounts fail to give a satisfactory explanation of scientific representations that make use of inconsistent mathematical theories and present an alternative, robustly inferential account of mathematical representation that provides not just a better explanation of applications of inconsistent mathematics, (...) but also a compelling explanation of mathematical representations of physical phenomena in general. 1Inconsistent Mathematics and the Problem of Representation2The Early Calculus3Mapping Accounts and the Early Calculus3.1Partial structures3.2Inconsistent structures3.3Related total consistent structures4A Robustly Inferential Account of the Early Calculus in Applications 4.1The robustly inferential conception of mathematical representation4.2The robustly inferential conception and inconsistent mathematics4.3The robustly inferential conception and mapping accounts5Beyond Inconsistent Mathematics. (shrink)

Val Plumwood charged classical logic not only with the invalidity of some of its laws, but also with the support of systemic oppression through naturalization of the logical structure of dualisms. In this paper I show that the latter charge - unlike the former - can be carried over to classical mathematics, and I propose a new conception of inconsistent mathematics - queer incomaths - as a liberatory activity meant to undermine said naturalization.

Contemporary mathematical theories are generally thought to be consistent. But it hasn’t always been this way; there have been times in the history of mathematics when the consistency of various mathematical theories has been called into question. And some theories, such as naïve set theory and (arguably) the early calculus, were shown to be inconsistent. In this paper I will consider some of the philosophical issues arising from inconsistent mathematical theories.

Dialethism is the view that there are sentences that are both true and false. Paraconsistent logics are those denying the principle of explosion (that is, they do not licence arbitrary conclusions...

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)

In this paper, I compare how it is that inconsistencies are handled in mathematics to how they are handled in chemistry. In mathematics, they are very precisely formulated and identified, unlike in chemistry. So the chemists can learn from the precision and the very well-worked out strategies developed by logicians and deployed by mathematicians to cope with inconsistency. Some lessons can also be learned by the mathematicians from the chemists. Mathematicians tend to be intolerant towards inconsistencies. There are (...) some philosophers of chemistry who attribute to chemists, collectively, a more tolerant attitude towards inconsistency, and so, mathematicians can learn from the chemists’ attitude to inform their choice of strategies. (shrink)

The concept of measuring inconsistency in information was developed by John Grant in a 1978 paper in the context of first-order logic. For more than 20 years very little was done in this area until in the early 2000s a number of AI researchers started to formulate new inconsistency measures primarily in the context of propositional logic knowledge bases. The aim of this volume is to survey what has been done so far, to expand inconsistency measurement to other formalisms, to (...) connect it with related topics, and to provide ideas for further research in a topic that is particularly relevant now in view of the many inconsistencies in the massive amount of information available. The book contains 11 chapters. The first chapter, by John Grant, gives his original motivation for starting this field, explains why it was formulated in a highly mathematical manner, presents important material that was omitted from the original paper, and provides ideas about the use of dimensions in measuring inconsistency. The second chapter, by Matthias Thimm, is a survey that covers most of the research on inconsistency measures up to 2017. The other 9 chapters, all by experts either in inconsistency measures, or in the topic under consideration, or both, connect inconsistency measures with argumentation, disjunctive logic programming, fuzzy logic systems, modal logics, multiset representation, paraconsistent consequence, probabilistic logic, relational databases, and spatio-temporal databases."-- back cover. (shrink)

Consequentialists typically think that the moral quality of one's conduct depends on the difference one makes. But consequentialists may also think that even if one is not making a difference, the moral quality of one's conduct can still be affected by whether one is participating in an endeavour that does make a difference. Derek Parfit discusses this issue – the moral significance of what I call ‘participation’ – in the chapter of Reasons and Persons that he devotes to what he (...) calls ‘moral mathematics’. In my paper, I expose an inconsistency in Parfit's discussion of moral mathematics by showing how it gives conflicting answers to the question of whether participation matters. I conclude by showing how an appreciation of Parfit's error sheds some light on consequentialist thought generally, and on the debate between act- and rule-consequentialists specifically. (shrink)

In this paper I shall consider two related avenues of argument that have been used to make the case for the inconsistency of mathematics: firstly, Gödel’s paradox which leads to a contradiction within mathematics and, secondly, the incompatibility of completeness and consistency established by Gödel’s incompleteness theorems. By bringing in considerations from the philosophy of mathematical practice on informal proofs, I suggest that we should add to the two axes of completeness and consistency a third axis of formality (...) and informality. I use this perspective to respond to the arguments for the inconsistency of mathematics made by Beall and Priest, presenting problems with the assumptions needed concerning formalisation, the unity of informal mathematics and the relation between the formal and informal. (shrink)

Mathias Frisch provides the first sustained philosophical discussion of conceptual problems in classical particle-field theories. Part of the book focuses on the problem of a satisfactory equation of motion for charged particles interacting with electromagnetic fields. As Frisch shows, the standard equation of motion results in a mathematically inconsistent theory, yet there is no fully consistent and conceptually unproblematic alternative theory. Frisch describes in detail how the search for a fundamental equation of motion is partly driven by pragmatic considerations (...) (like simplicity and mathematical tractability) that can override the aim for full consistency. The book also offers a comprehensive review and criticism of both the physical and philosophical literature on the temporal asymmetry exhibited by electromagnetic radiation fields, including Einstein's discussion of the asymmetry and Wheeler and Feynman's influential absorber theory of radiation. Frisch argues that attempts to derive the asymmetry from thermodynamic or cosmological considerations fail and proposes that we should understand the asymmetry as due to a fundamental causal constraint. The book's overarching philosophical thesis is that standard philosophical accounts that strictly identify scientific theories with a mathematical formalism and a mapping function specifying the theory's ontology are inadequate, since they permit neither inconsistent yet genuinely successful theories nor thick causal notions to be part of fundamental physics. (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 paper explains how a paraconsistent logician can appropriate all classical reasoning. This is to take consistency as a default assumption, and hence to work within those models of the theory at hand which are minimally inconsistent. The paper spells out the formal application of this strategy to one paraconsistent logic, first-order LP. (See, Ch. 5 of: G. Priest, In Contradiction, Nijhoff, 1987.) The result is a strong non-monotonic paraconsistent logic agreeing with classical logic in consistent situations. It is (...) shown that the logical closure of a theory under this logic is trivial only if its closure under LP is trivial. (shrink)

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)

I show that the standard approach to modeling phenomena involving microscopic classical electrodynamics is mathematically inconsistent. I argue that there is no conceptually unproblematic and consistent theory covering the same phenomena to which this inconsistent theory can be thought of as an approximation; and I propose a set of conditions for the acceptability of inconsistent theories.

This paper investigates the topological construction of Wedge Sum, with the aim of showing that it can be done mathematically, via a quotient construction, or logically, via Merge. Consistent and Inconsistent versions are given, while noting that the natural outcome of Merging is an inconsistent theory. Finally it is observed that algebraic constructions can also be treated via Merge, where the extra functionality makes for various triviality and non-triviality results.

This paper discusses a conception of physics as a collection of theories that, from a logical point of view, is inconsistent. It is argued that this logical conception of the relations between physical theories is too crude. Mathematical subtleties allow for a much more nuanced and sophisticated understanding of the relations between different physical theories.

Graham Priest introduces an informal but presumably rigorous and sharp ‘provability predicate’. He argues that this predicate yields inconsistencies, along the lines of the paradox of the Knower. One long-standing claim of Priest’s is that a dialetheist can have a complete, decidable, and yet sufficiently rich mathematical theory. After all, the incompleteness theorem is, in effect, that for any recursive theory A, if A is consistent, then A is incomplete. If the antecedent fails, as it might for a dialetheist, then (...) the consequent may also fail to hold. One somewhat friendly purpose of my ‘Incompleteness and inconsistency’ was to improve the technical situation for the dialetheist, eschewing reliance on an informal provability predicate. Another, less friendly purpose was to bring out what I took to be some untoward consequences of the situation. It seems that Priest accepted at least some of the improvements that I attempted. In the second edition of In contradiction, he responded to the alleged untoward consequences. One purpose of this note is to revisit the technical and philosophical situation. There were some errors in my original presentation, brought out by discussion with Priest and by Hartry Field’s analysis of the second incompleteness theorem in such contexts. A second task here is to present a sort of Curry version of the Gödel incompleteness situation. I tentatively conclude that even for a dialetheist, an interesting and complete theory is not as easy to come by as it may look—at least not for theories of arithmetic that are plausible for a dialetheist. (shrink)

Classical logic is explosive in the face of contradiction, yet we find ourselves using inconsistent theories. Mark Colyvan, one of the prominent advocates of the indispensability argument for realism about mathematical objects, suggests that such use can be garnered to develop an argument for commitment to inconsistent objects and, because of that, a paraconsistent underlying logic. I argue to the contrary that it is open to a classical logician to make distinctions, also needed by the paraconsistent logician, which (...) allow a more nuanced ranking of theories in which inconsistent theories can have different degrees of usefulness and productivity. Facing inconsistency does not force us to adopt an underlying paraconsistent logic. Moreover we will see that the argument to best explanation deployed by Colyvan in this context is unsuccessful. I suggest that Quinean approach which Colyvan champions will not lead to the revolutionary doctrines Colyvan endorses. (shrink)

This article proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this article we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and inconsistency in the style of the so-called Logics of Formal Inconsistency (LFIs). The main novelty of the present approach is the definition of postulates for this type of operators over MTL-algebras, leading to the definition and axiomatization of a family of logics, expansions of (...) MTL, whose degree-preserving counterpart are paraconsistent and moreover LFIs. (shrink)

W. V. Quine’s systematic development of mathematical logic has been widely praised for the new material presented and for the clarity of its exposition. This revised edition, in which the minor inconsistencies observed since its first publication have been eliminated, will be welcomed by all students and teachers in mathematics and philosophy who are seriously concerned with modern logic. Max Black, in Mind, has said of this book, “It will serve the purpose of inculcating, by precept and example, standards (...) of clarity and precision which are, even in formal logic, more often pursued than achieved.”. (shrink)

In this book, Peter Vickers argues that inconsistency in science has been massively exaggerated by philosophers. In his view, inconsistent science is neither as rampant nor as damaging as many have supposed. To argue his point, he develops a specific method he calls theory eliminativism and applies it to four case studies from the history of physics and mathematics .The method is original and convincing, and the case studies well researched and compelling. Vickers’ monograph provides a challenge to (...) any philosopher of science who takes inconsistency claims seriously, while also introducing a potentially very useful methodology for analyzing away problematic ‘theory’ discourse in other philosophical debates. Overall then, this is a very creative text and useful for both those directly interested in .. (shrink)

As consistency is such an important topic in logic, researchers have for a long time investigated how to attain and maintain it. But consistency can also be studied from the point of view of its opposite, inconsistency. The problem with inconsistency in classical logic is that by the principle of explosion a single inconsistency leads to triviality. Paraconsistent logics were introduced to get around this problem by defining logics in such a way that the explosion principle does not apply to (...) them. Another approach stays in the classical framework and evaluates the amount of inconsistency in a set of formulas. The great bulk of this work has been done for propositional logic and presents many interesting issues about inconsistency. A previous paper introduced the concept of generalized propositional logic (GPL) to provide a uniform method for measuring inconsistency in logics that allow the application of unary operator pairs, such as for modality, time, and space, to propositional logic formulas. The universality of GPL manifests itself in the fact that such an operator pair is evaluated in a uniform manner across all such logics. The difference lies solely in the choice of a frame for each logic. But some logics also contain nonunary operators. For example, temporal logics typically contain a binary Until operator. The purpose of this paper is to show how to extend generalized propositional logic to extended generalized propositional logic (EGPL) by adding nonunary operator pairs and measure inconsistency in such logics. The universality of EGPL manifests itself in the fact that once the evaluation of the nonunary operators is given, it carries over to all such logics. For example, the temporal Until operator becomes applicable to modal logic. Furthermore, while relative inconsistency measures were previously considered for GPL, they are now extended to EGPL and a new approach removes an undesirable feature from the previous version. Also, this paper provides results about various properties of the new inconsistency measures. Many examples and explanations are given to illustrate the issues involving this extension. (shrink)

This paper develops in certain directions the work of Meyer in [3], [4], [5] and [6] (see also Routley [10] and Asenjo [11]). 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 (see e.g. [1] or [8]), 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 (called in this paper RM32) 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 (called RM3i here). 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 (whether or not consistent and recursively enumerable). In the rest of the paper we apply these techniques to several topics, particularly relevant quantum arithmetic in which we are able to show (unlike classical quantum arithmetic) 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)

In this paper I sketch some lines of response to Mark Colyvan’s indispensability arguments for the existence of inconsistent objects, being mainly concerned with the indispens ability of inconsistent mathematical entities. My response will draw heavily on Jody Azzouni’s deflationary nominalism.

M. Forti and F. Honsell showed in [4] that the hyperuniverses defined in [2] satisfy the anti-foundation axiom X1 introduced in [3]. So it is interesting to study the axiom AFA, which is equivalent to X1 in ZF, introduced by P. Aczel in [1]. We show in this paper that AFA is inconsistent with the theory GPK. This theory, which is first order, is defined by E. Weydert in [6] and later by M. Forti and R. Hinnion in [2]. (...) It includes all general hyperuniverses as defined in [5]. In order to achieve our aim, we need to define ordinals in GPK and to study some of their properties. (shrink)

Mathematical pluralism can take one of three forms: (1) every consistent mathematical theory consists of truths about its own domain of individuals and relations; (2) every mathematical theory, consistent or inconsistent, consists of truths about its own (possibly uninteresting) domain of individuals and relations; and (3) the principal philosophies of mathematics are each based upon an insight or truth about the nature of mathematics that can be validated. (1) includes the multiverse approach to set theory. (2) helps (...) us to understand the significance of the distinguished non‐logical individual and relation terms of even inconsistent theories. (3) is a metaphilosophical form of mathematical pluralism and hasn't been discussed in the literature. In what follows, I show how the analysis of theoretical mathematics in object theory exhibits all three forms of mathematical pluralism. (shrink)

The importance of Georg Cantor’s religious convictions is often neglected in discussions of his mathematics and metaphysics. Herein I argue, pace Jan ́e (1995), that due to the importance of Christianity to Cantor, he would have never thought of absolutely infinite collections/inconsistent multiplicities,as being merely potential, or as being purely mathematical entities. I begin by considering and rejecting two arguments due to Ignacio Jan ́e based on letters to Hilbert and the generating principles for ordinals, respectively, showing that (...) my reading of Cantor is consistent with that evidence. I then argue that evidence from Cantor’s later writings shows that he was still very religious later in his career, and thus would not have given up on the reality of the absolute, as that would imply an imperfection on the part of God. (shrink)

In this paper, the problem of purifying an assumption-based theory KB, i.e., identifying the right extension of KB using knowledge-gathering actions (tests), is addressed. Assumptions are just normal defaults without prerequisite. Each assumption represents all the information conveyed by an agent, and every agent is associated with a (possibly empty) set of tests. Through the execution of tests, the epistemic status of assumptions can change from "plausible" to "certainly true", "certainly false" or "irrelevant", and the KB must be revised so (...) as to incorporate such a change. Because removing all the extensions of an assumption-based theory except one enables both identifying a larger set of plausible pieces of information and renders inference computationally easier, we are specifically interested in finding out sets of tests allowing to purify a KB (whatever their outcomes). We address this problem especially from the point of view of computational complexity. (shrink)

The relationship between logics with sets of theorems including contradictions (“inconsistent logics”) and theories closed under such logics is investigated. It is noted that if we take “theories” to be defined in terms of deductive closure understood in a way somewhat different from the standard, Tarskian, one, inconsistent logics can have consistent theories. That is, we can find some sets of formulas the closure of which under some inconsistent logic need not contain any contradictions. We prove this (...) in a general setting for a family of relevant connexive logics, extract the essential features of the proof in order to obtain a sufficient condition for the consistency of a theory in arbitrary logics, and finally consider some concrete examples of consistent mathematical theories in Abelian logic. The upshot is that on this way of understanding deductive closure, common to relevant logics, there is a rich and interesting kind of interaction between inconsistent logics and their theories. We argue that this suggests an important avenue for investigation of inconsistent logics, from both a technical and a philosophical perspective. (shrink)

It is often loosely said that Ramsey The foundations of mathematics and other logical essays, Routledge and Kegan Paul, Abingdon, pp 156–198, 1931) and de Finetti Studies in subjective probability, Kreiger Publishing, Huntington, 1937) proved that if your credences are inconsistent, then you will be willing to accept a Dutch Book, a wager portfolio that is sure to result in a loss. Of course, their theorems are true, but the claim about acceptance of Dutch Books assumes a particular (...) method of calculating expected utilities given the inconsistent credences. I will argue that there are better ways of calculating expected utilities given a potentially inconsistent credence assignment, and that for a large class of credences—a class that includes many inconsistent examples—these ways are immune to Dutch Books and single-shot domination failures. The crucial move is to replace Finite Additivity with Monotonicity, then \\le P\)) and then calculate expected utilities for positive U via the formula \\, dy\). This shows that Dutch Book arguments for probabilism, the thesis that one’s credences should be consistent, do not establish their conclusion. Finally, I will consider a modified argument based on multi-step domination failure that does better, but nonetheless is not as compelling as the Dutch Book arguments appeared to be. (shrink)

Idealized scientific representations result from employing claims that we take to be false. It is not surprising, then, that idealizations are a prime example of allegedly inconsistent scientific representations. I argue that the claim that an idealization requires inconsistent beliefs is often incorrect and that it turns out that a more mathematical perspective allows us to understand how the idealization can be interpreted consistently. The main example discussed is the claim that models of ocean waves typically involve the (...) false assumption that the ocean is infinitely deep. While it is true that the variable associated with depth is often taken to infinity in the representation of ocean waves, I explain how this mathematical transformation of the original equations does not require the belief that the ocean being modeled is infinitely deep. More generally, as a mathematical representation is manipulated, some of its components are decoupled from their original physical interpretation. (shrink)