This book is the first in the field of paraconsistency to offer a comprehensive overview of the subject, including connections to other logics and applications in information processing, linguistics, reasoning and argumentation, and philosophy of science. It is recommended reading for anyone interested in the question of reasoning and argumentation in the presence of contradictions, in semantics, in the paradoxes of set theory and in the puzzling properties of negation in logic programming. Paraconsistent logic comprises a major logical theory (...) and offers the broadest possible perspective on the debate of negation in logic and philosophy. It is a powerful tool for reasoning under contradictoriness as it investigates logic systems in which contradictory information does not lead to arbitrary conclusions. Reasoning under contradictions constitutes one of most important and creative achievements in contemporary logic, with deep roots in philosophical questions involving negation and consistency This book offers an invaluable introduction to a topic of central importance in logic and philosophy. It discusses the history of paraconsistent logic; language, negation, contradiction, consistency and inconsistency; logics of formal inconsistency and the main paraconsistent propositional systems; many-valued companions, possible-translations semantics and non-deterministic semantics; paraconsistent modal logics; first-order paraconsistent logics; applications to information processing, databases and quantum computation; and applications to deontic paradoxes, connections to Eastern thought and to dialogical reasoning. (shrink)

Although logical consistency is desirable in scientific research, standard statistical hypothesis tests are typically logically inconsistent. To address this issue, previous work introduced agnostic hypothesis tests and proved that they can be logically consistent while retaining statistical optimality properties. This article characterizes the credal modalities in agnostic hypothesis tests and uses the hexagon of oppositions to explain the logical relations between these modalities. Geometric solids that are composed of hexagons of oppositions illustrate the conditions for these modalities (...) to be logically consistent. Prisms composed of hexagons of oppositions show how the credal modalities obtained from two agnostic tests vary according to their threshold values. Nested hexagons of oppositions summarize logical relations between the credal modalities in these tests and prove new relations. (shrink)

Simultaneous hypothesis tests can fail to provide results that meet logical requirements. For example, if A and B are two statements such that A implies B, there exist tests that, based on the same data, reject B but not A. Such outcomes are generally inconvenient to statisticians (who want to communicate the results to practitioners in a simple fashion) and non-statisticians (confused by conflicting pieces of information). Based on this inconvenience, one might want to use tests that satisfy (...) class='Hi'>logical requirements. However, Izbicki and Esteves shows that the only tests that are in accordance with three logical requirements (monotonicity, invertibility and consonance) are trivial tests based on point estimation, which generally lack statistical optimality. As a possible solution to this dilemma, this paper adapts the above logical requirements to agnostic tests, in which one can accept, reject or remain agnostic with respect to a given hypothesis. Each of the logical requirements is characterized in terms of a Bayesian decision theoretic perspective. Contrary to the results obtained for regular hypothesis tests, there exist agnostic tests that satisfy all logical requirements and also perform well statistically. In particular, agnostic tests that fulfill all logical requirements are characterized as region estimator-based tests. Examples of such tests are provided. (shrink)

The book Paraconsistent Logic: Consistency, Contradiction and Negation by Walter Carnielli and Marcelo Coniglio is the most thorough study of Logics of Formal Inconsistency...

In this paper I present a new way of understanding Dutch Book Arguments: the idea is that an agent is shown to be incoherent iff he would accept as fair a set of bets that would result in a loss under any interpretation of the claims involved. This draws on a standard definition of logical inconsistency. On this new understanding, the Dutch Book Arguments for the probability axioms go through, but the Dutch Book Argument for Reflection fails. The question (...) of whether we have a Dutch Book Argument for Conditionalization is left open. (shrink)

Moral conflicts are real, and while a deontic logic containing a modified "agglomeration rule" may be able to accommodate this fact, even the most sophisticated logic will still overlook much of what everyday normative reasoning involves.

On an expressivist view, ethical claims are understood as expressions of our attitudes, desires, and feelings. A famous puzzle for this view concerns the use of logic in ethical reasoning, and two standard treatments try to solve the puzzle by explaining logical inconsistency in terms of conflicting attitudes. I argue, however, that this general strategy fails: because we can reason effectively even in the presence of conflicting moral attitudes – in cases of moral dilemmas – avoiding these conflicts cannot (...) be a ground for correct moral reasoning. The result is a dilemma for expressivists: if they take all kinds of attitudes to be under consideration, then conflict cannot play the required role, since attitudes can fail to be compatible in cases of moral conflict. If they restrict attention to ‘all-in attitudes’ or to intentions or plans, then there is an important notion of obligation, used in standard arguments – one for which conflicts are allowed – that they fail to capture. I explain why expressivists should be especially tolerant of conflicting attitudes, and I conclude that they should pursue a different strategy for grounding logical normativity. (shrink)

The logical consistency of a collection of assertions about events can be viewed as a special case of coherent probability assessments in the sense of de Finetti.

El objetivo principal de este artículo es precisar los elementos que operan en el substrato de la filosofía de Thomas Hobbes y que permiten dar coherencia lógica a su sistema. Para ello se apela a la idea de concepto operatorio desarrollada por Eugen Fink, a la vez que se llama la atención sobre la importancia de considerar la filosofía hobbesiana en su totalidad. Esto implica que cualquier análisis de la teoría política de Hobbes debe considerar las relaciones existentes con las (...) concepciones científicas hobbesianas. (shrink)

The book Paraconsistent Logic: Consistency, Contradiction and Negation by Walter Carnielli and Marcelo Coniglio is the most thorough study of Logics of Formal Inconsistency...

The Swiss psychologist Jean Piaget contends that children below the age of 12 see no necessity for the logical law of non-contradiction. I argue this view is problematic. First of all, Piaget's dialogues with children which are considered supportive of this position are not clearly so. Secondly, Piaget underestimates the necessary nature of following the logical law of non-contradiction in everyday discourse. The mere possibility of saying something significant and informative at all presupposes that the law of non-contradiction (...) is enforced. (shrink)

According to the metaethics of R. M. Hare, we determine morality objectively by making a moral judgment, committing to the moral principle underlying that judgment, and then logically extending that moral principle to all relevantly similar cases. This metaethical system called universal prescriptivism had a major impact on Peter Singer, whose arguments for radically improving animal welfare and alleviating global suffering frequently rely on Hare-ian appeals to logical consistency. Hare’s work in metaethics is largely rejected now, but Singer’s (...) popularity has kept Hare’s prescriptivism alive through the many animal welfarists and effective altruists who have borrowed Singer’s style in their own logic-based calls for the obligation to reduce suffering impartially. In this paper, I will describe Hare’s metaethics, show how this has served as Singer’s own metaethics for most of his academic career, and then I will describe a problem for Hare’s system that is particularly relevant to effective altruists who have been influenced by Singer’s early writings and may be repeating the mistakes that Hare bequeathed to Singer. (shrink)

Counterfactual definiteness is supposed to underlie the Bell theorem. An old controversy exists among those who reject the theorem implications by rejecting counterfactual definiteness and those who claim that, since it is a direct consequence of locality, it cannot be independently rejected. We propose a different approach for solving this contentious issue by realizing that counterfactual definiteness is an unnecessary and inconsistent assumption. Counterfactual definiteness is not equivalent to realism or determinism neither it follows from locality. It merely reduces to (...) an incongruent application of counterfactual reasoning. Being incompatible with falsifiability, it constitutes an unjustified assumption that goes against the scientific method rigor. Correct formulations of the Bell theorem’s bases show it is absent either as a fundamental hypothesis or as a consequence of something else. Most importantly, we present a coherent Bell inequality derivation carefully devised to show explicitly and convincingly the absence of incompatible experiments or counterfactual reasoning. Thus, even admitting that counterfactual definiteness could be a consistent assumption, the necessary conclusion is that it is irrelevant for the inequality formulation and can be safely ignored when discussing Bell’s inequality philosophical and physical implications. (shrink)

Review of the book "Paraconsistent Logic: Consistency, Contradiction, and Negation by Water Carnielli and Marcelo Coniglio.

In this paper, I consider two curious subsystems ofFrege's Grundgesetze der Arithmetik: Richard Heck's predicative fragment H, consisting of schema V together with predicative second-order comprehension (in a language containing a syntactical abstraction operator), and a theory T in monadic second-order logic, consisting of axiom V and 1 1-comprehension (in a language containing anabstraction function). I provide a consistency proof for the latter theory, thereby refuting a version of a conjecture by Heck. It is shown that both Heck and (...) T prove the existence of infinitely many non-logical objects (T deriving,moreover, the nonexistence of the value-range concept). Some implications concerning the interpretation of Frege's proof of referentiality and the possibility of classifying any of these subsystems as logicist are discussed. Finally, I explore the relation of T toCantor's theorem which is somewhat surprising. (shrink)

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the assumptions codified by the theory in question to be consistent with those background axioms. But determining the specific choice and division of background axioms is, at least sometimes, little more than tradition. This paper introduces generic theories for propositional modal logic (...) to address consistency results in a more robust way. As building blocks for background knowledge, generic theories provide a standard for categorical determinations of consistency. We argue that the results and methods of this paper help to elucidate problems in epistemology and enjoy sufficient scope and power to have purchase on problems bearing on modalities in judgement, inference, and decision making. (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)

The logics of formal inconsistency are logics tolerant to some amount of contradiction, but in which some versions of explosion still hold. The main result of this paper is a reconstruction of two such logics in the dialogical framework. By doing so, we achieve two things. On the one hand, we provide a formal approach to argumentative situations where some contradictions may occur while keeping the idea that there may still be situations in which some propositions are ‘safe’ in the (...) sense of immunity to the contradictions. On the other hand, we open a new line of study on these logics, in the context of the game-theoretical approach to semantics born in the 1960s, with various interesting perspectives, some of which are discussed at the end of this article. (shrink)

G. Priest's anti-consistency argument (Priest 1979, 1984, 1987) and J. R. Lucas's anti-mechanist argument (Lucas 1961, 1968, 1970, 1984) both appeal to Gödel incompleteness. By way of refuting them, this paper defends the thesis of quartet compatibility, viz., that the logic of the mind can simultaneously be Gödel incomplete, consistent, mechanical, and recursion complete (capable of all means of recursion). A representational approach is pursued, which owes its origin to works by, among others, J. Myhill (1964), P. Benacerraf (1967), (...) J. Webb (1980, 1983) and M. Arbib (1987). It is shown that the fallacy shared by the two arguments under discussion lies in misidentifying two systems, the one for which the Gödel sentence is constructable and to be proved, and the other in which the Gödel sentence in question is indeed provable. It follows that the logic of the mind can surpass its own Gödelian limitation not by being inconsistent or non-mechanistic, but by being capable of representing stronger systems in itself; and so can a proper machine. The concepts of representational provability, representational maximality, formal system capacity, etc., are discussed. (shrink)

The Unprovability of Consistency is concerned with connections between two branches of logic: proof theory and modal logic. Modal logic is the study of the principles that govern the concepts of necessity and possibility; proof theory is, in part, the study of those that govern provability and consistency. In this book, George Boolos looks at the principles of provability from the standpoint of modal logic. In doing so, he provides two perspectives on a debate in modal logic that (...) has persisted for at least thirty years between the followers of C. I. Lewis and W. V. O. Quine. The author employs semantic methods developed by Saul Kripke in his analysis of modal logical systems. The book will be of interest to advanced undergraduate and graduate students in logic, mathematics and philosophy, as well as to specialists in those fields. (shrink)

The logic B+ is Routley and Meyer’s basic positive logic. We define the logics BK+ and BK'+ by adding to B+ the K rule and to BK+ the characteristic S4 axiom, respectively. These logics are endowed with a relatively strong non-constructive negation. We prove that all the logics defined lack the K axiom and the standard paradoxes of consistency.

In a paper published in 1975, Robert Jeroslow introduced the concept of an experimental logic as a generalization of ordinary formal systems such that theoremhood is a (or in practice ) rather than . These systems can be viewed as (rather crude) representations of axiomatic theories evolving stepwise over time. Similar ideas can be found in papers by Putnam (1965) and McCarthy and Shapiro (1987). The topic of the present article is a discussion of a suggestion by Allen Hazen, that (...) these experimental logics might provide an illuminating way of representing “the human mathematical mind”. This is done in the context of the well-known Lucas-Penrose thesis. Though we agree that Jeroslow's model has some merit in this context, and that the Lucas-Penrose arguments certainly are less than persuasive, some semi-technical doubts are raised concerning the alleged impact of experimental logics on the question of knowable self-consistency. (shrink)

Arif Ahmed has recently argued that causal decision theory is dynamically inconsistent and that we should therefore prefer evidential decision theory. However, the principal formulation of the evidential theory, Richard Jeffrey’s Logic of Decision, has a mixed record of its own when it comes to evaluating plans consistently across time. This note probes that neglected record, establishing the dynamic consistency of evidential decision theory within a restricted class of problems but then illustrating how evidentialists can fall into sequential incoherence (...) outside of this class. Uncovering the evidentialist’s own dynamic inconsistencies reveals, contra Ahmed, that sequential choice considerations do not significantly favor the evidentialist’s theory over the causalist’s. (shrink)

In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa’s approach, which seeks to allow the use of classical logic whenever it is safe to do so, but behaves completely differently when contradictions are involved. Da Costa’s approach has led to the family of logics (...) of formal (in)consistency (LFIs). In this paper we provide in a modular way simple non-deterministic semantics for 64 of the most important logics from this family. Our semantics is 3-valued for some of the systems, and infinite-valued for the others. We prove that these results cannot be improved: neither of the systems with a three-valued non-deterministic semantics has either a finite characteristic ordinary matrix or a two-valued characteristic non-deterministic matrix, and neither of the other systems we investigate has a finite characteristic non-deterministic matrix. Still, our semantics provides decision procedures for all the systems investigated, as well as easy proofs of important proof-theoretical properties of them. (shrink)

This essay demonstrates proof-theoretically the consistency of a type-free theoryC with an unrestricted principle of comprehension and based on a predicate logic in which contraction (A (A B)) (A B), although it cannot holds in general, is provable for a wide range ofA's.C is presented as an axiomatic theoryCH (with a natural-deduction equivalentCS) as a finitary system, without formulas of infinite length. ThenCH is proved simply consistent by passing to a Gentzen-style natural-deduction systemCG that allows countably infinite conjunctions and (...) in which all theorems ofCH are provable.CG is seen to be a consistent by a normalization argument. It also shown that in a senseC is highly non-extensional. (shrink)

In “Truth and Probability” Ramsey claimed that the logic of consistency for probability is not a logic of truth. After supporting this claim, he proceeded to explore the possibilities for a logic of truth for probability. An examination of Ramsey's intent reveals that Ramsey was far from being an orthodox Bayesian when it comes to statistical reasoning. The relations between Ramsey's thought and the ideas of Keynes and Peirce are discussed.

We prove Robinson consistency theorem as well as Craig, Lyndon and Herbrand interpolation theorems in linear continuous logic.