Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; and (...) (iii) that it is hybrid, insofar as it includes both left and right operational introduction as well as elimination rules. (shrink)

We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from previous research in paraconsistent set theory, which has almost exclusively been motivated by a desire to avoid Russell’s paradox and fulfil naive comprehension. Instead, we prioritise setting up a system with a clear ontology of non-classical sets, which can (...) be used to reason informally about incomplete and inconsistent phenomena, and is sufficiently similar to ${\mathrm {ZFC}}$ to enable the development of interesting mathematics. We propose an axiomatic system ${\mathrm {BZFC}}$, obtained by analysing the ${\mathrm {ZFC}}$ -axioms and translating them to a four-valued setting in a careful manner, avoiding many of the obstacles encountered by other attempted formalizations. We introduce the anti-classicality axiom postulating the existence of non-classical sets, and prove a surprising results stating that the existence of a single non-classical set is sufficient to produce any other type of non-classical set. Our theory is naturally bi-interpretable with ${\mathrm {ZFC}}$, and provides a philosophically satisfying view in which non-classical sets can be seen as a natural extension of classical ones, in a similar way to the non-well-founded sets of Peter Aczel [1]. Finally, we provide an interesting application concerning Tarski semantics, showing that the classical definition of the satisfaction relation yields a logic precisely reflecting the non-classicality in the meta-theory. (shrink)

In this paper a first order theory for the logics defined through literal paraconsistent-paracomplete matrices is developed. These logics are intended to model situations in which the ground level information may be contradictory or incomplete, but it is treated within a classical framework. This means that literal formulas, i.e. atomic formulas and their iterated negations, may behave poorly specially regarding their negations, but more complex formulas, i.e. formulas that include a binary connective are well behaved. This situation may (...) and does appear for instance in data bases. (shrink)

The study of the theory of operators over modal pseudocomplemented De Morgan algebras was begun in papers [20] and [21]. In this paper, we introduce and study the class of modal pseudocomplemented De Morgan algebras enriched by a k-periodic automorphism -algebras). We denote by \ the automorphism where k is a positive integer. For \, the class coincides with the one studied in [20] where the automorphism works as a new unary operator which can be considered as a negation. (...) In the first place, we develop an algebraic study of the class of \-algebras; as consequence, we prove the class \-algebras is a semisimple variety and determine the generating algebras. After doing the algebraic study and using these properties, we built two families of sentential logics that we denote with \ and \ for every k. \ is a 1-assertional logic and \ is the degree-preserving logic both associated with the class of \-algebras. Working over these logics, we prove that \ is paraconsistent with respect to the de Morgan negation \, which is protoalgebraic and finitely equivalential but not algebraizable. In contrast, we prove that \ is algebraizable, sharing the same theorems with \, but not paraconsistent with respect to \. Furthermore, we show that \ and \ are paracomplete logics with respect to \ and \ and paraconsistent logics with respecto to \, for every k. (shrink)

We put forward the hypothesis that there exist three basic attitudes towards inconsistencies within world views: (1) The inconsistency is tolerated temporarily and is viewed as an expression of a temporary lack of knowledge due to an incomplete or wrong theory. The resolution of the inconsistency is believed to be inherent to the improvement of the theory. This improvement ultimately resolves the contradiction and therefore we call this attitude the ‘regularising’ attitude; (2) The inconsistency is tolerated and both (...) contradicting elements in the theory are retained. This attitude integrates the inconsistency and leads to a paraconsistent calculus; therefore we will call it the paraconsistent attitude. (3) In the third attitude, both elements of inconsistency are considered to be false and the ‘real situation’ is considered something different that can not be described by the theory constructively. This indicates the incompleteness of the theory, and leads us to a paracomplete calculus; therefore we call it the paracomplete attitude. We illustrate these three attitudes by means of two ‘paradoxical’ situations in quantum mechanics, the wave-particle duality and the situation of non locality. (shrink)

In this paper I urge friends of truth-value gaps and truth-value gluts – proponents of paracomplete and paraconsistent logics – to consider theories not merely as sets of sentences, but as pairs of sets of sentences, or what I call ‘bitheories,’ which keep track not only of what holds according to the theory, but also what fails to hold according to the theory. I explain the connection between bitheories, sequents, and the speech acts of assertion and denial. (...) I illustrate the usefulness of bitheories by showing how they make available a technique for characterising different theories while abstracting away from logical vocabulary such as connectives or quanti- fiers, thereby making theoretical commitments independent of the choice of this or that particular non-classical logic. (shrink)

"An important contribution to contemporary jurisprudential debate and to legal thought more generally, Just Interpretations is far ahead of currently available work."--Peter Goodrich, author of Oedipus Lex "I was struck repeatedly by the clarity of expression throughout the book. Rosenfeld's description and criticism of the recent work of leading thinkers distinguishes his work within the legal theory genre. Furthermore, his own theory is quite original and provocative."--Aviam Soifer, author of Law and the Company We Keep.

According to truthmaker maximalism, each truth has a truthmaker. Peter Milne has attempted to refute truthmaker maximalism on mere logical grounds via the construction of a self-referential truthmaker sentence M “saying” of itself that it doesn’t have a truthmaker. Milne argues that M turns out to be a true sentence without a truthmaker and thus provides a counterexample to truthmaker maximalism. In this paper, I show that Milne’s refutation of truthmaker maximalism does not succeed. In particular, I argue that the (...) notion of truthmaker meets two structural principles which, if added to a formal language of a theory, are already sufficient to produce a provable contradiction—a contradiction that gives rise to a socalled “Truthmaker paradox”. I also address the question of how to possibly resolve the Truthmaker paradox. I thereby show that the Truthmaker paradox, just as the strengthened Liar paradox, yields a “revenge problem” for paracomplete theories and might lead to triviality for Priest’s dialetheist account LP if the notion of truthmaker is defined as a certain semantic predicate within LP. But regardless of how one tries to cope with the Truthmaker paradox, this paradox is surely interesting in its own right. However, its significance is completely orthogonal to the question of whether truthmaker maximalism is a philosophically sound view. (shrink)

Richard Heck has recently drawn attention on a new version of the Liar Paradox, one which relies on logical resources that are so weak as to suggest that it may not admit of any “truly satisfying, consistent solution”. I argue that this conclusion is too strong. Heck's Liar reduces to absurdity principles that are already rejected by consistent paracomplete theories of truth, such as Kripke's and Field's. Moreover, the new Liar gives us no reasons to think that (versions of) (...) these principles cannot be consistently retained once the structural rule of contraction is restricted. I suggest that revisionary logicians have independent reasons for restricting such a rule. (shrink)

Peirce’s triadic logic has been under discussion since its discovery in the 1960s by Fisch and Turquette. The experiments with matrices of three-valued logic are recorded in a few pages of unpublished manuscripts dated 1909, a decade before similar systems have been developed by logicians. The purposes of Peirce’s work on such logic, as well as semantical aspects of his system, are disputable. In the most extensive work about it, Turquette suggested that the matrices are related in dual pairs of (...) axiomatic Hilbert-style systems. In this paper, we present a simple tableau proof for a fragment of Peirce three-valued logic, called P3, based on similar approaches in many-valued literature. We demonstrated that this proof is sound and complete. Besides that, taking the false as the only undesignated value and adding non-classical negations to the calculus, we can explore paraconsistent and paracompleteness theories into P3. Keywords: Charles S. Peirce, many-valued logics, theory of proof, tableau method. (shrink)

Richard Heck has recently drawn attention on a new version of the Liar Paradox, one which relies on logical resources that are so weak as to suggest that it may not admit of any ‘‘truly satisfying, consistent solution’’. I argue that this conclusion is too strong. Heck’s Liar reduces to absurdity principles that are already rejected by consistent paracomplete theories of truth, such as Kripke’s and Field’s. Moreover, the new Liar gives us no reasons to think that these principles (...) cannot be consistently retained once the structural rule of contraction is restricted. I suggest that revisionary logicians have independent reasons for restricting such a rule. (shrink)

The topic of exemplarity has attracted considerable interest in philosophy, legal theory, literary studies and art recently. There is broad consensus that exemplary cases mediate between singular instances and general concepts or norms. The aim of this article is to provide an additional perspective on the logic of exemplarity. First, inspired by Jacques Derrida’s discussion of exemplarity, I shall argue that there is a kind of différance between (singular) examples and (general) exemplars. What an example exemplifies, the exemplarity of (...) the example, eludes any fixed identity and follows a logic of supplement. Second, I shall present the so-called logic of exemplarity. The received paraconsistent view has it that the exemplar of X is an X and, at the same time, is not an X. Inspired by Ludwig Wittgenstein’s discussion of the standard metre, I would like to present an alternative paracomplete view whereby we can say of an exemplar of X neither that it is an X nor that it is not an X. (shrink)

. I give a systematic presentation of a fairly large family of multiple-conclusion modal logics that are paraconsistent and/or paracomplete. After providing motivation for studying such systems, I present semantics and tableau-style proof theories for them. The proof theories are shown to be sound and complete with respect to the semantics. I then show how the “standard” systems of classical, single-conclusion modal logics fit into the framework constructed.

Paradefinite logics are logics that can be used for handling contradictory or partial information. As such, paradefinite logics should be both paraconsistent and paracomplete. In this paper we consider the simplest semantic framework for introducing paradefinite logics. It consists of the four-valued matrices that expand the minimal matrix which is characteristic for first degree entailments: Dunn–Belnap matrix. We survey and study the expressive power and proof theory of the most important logics that can be developed in this framework.

Weakening classical logic is one of the most popular ways of dealing with semantic paradoxes. Their advocates often claim that such weakening does not affect non-semantic reasoning. Recently, however, Halbach and Horsten have shown that this is actually not the case for Kripke’s fixed-point theory based on the Strong Kleene evaluation scheme. Feferman’s axiomatization $\textsf{KF}$ in classical logic is much stronger than its paracomplete counterpart $\textsf{PKF}$, not only in terms of semantic but also in arithmetical content. This paper (...) compares the proof-theoretic strength of an axiomatization of Kripke’s construction based on the paraconsistent evaluation scheme of $\textsf{LP}$, formulated in classical logic with that of an axiomatization directly formulated in $\textsf{LP}$, extended with a consistency operator. The ultimate goal is to find out whether paraconsistent solutions to the paradoxes that employ consistency operators fare better in this respect than paracomplete ones. (shrink)

Paraconsistent approaches have received little attention in the literature on vagueness (at least compared to other proposals). The reason seems to be that many philosophers have found the idea that a contradiction might be true (or that a sentence and its negation might both be true) hard to swallow. Even advocates of paraconsistency on vagueness do not look very convinced when they consider this fact; since they seem to have spent more time arguing that paraconsistent theories are at least as (...) good as their paracomplete counterparts, than giving positive reasons to believe on a particular paraconsistent proposal. But it sometimes happens that the weakness of a theory turns out to be its mayor ally, and this is what (I claim) happens in a particular paraconsistent proposal known as subvaluationism. In order to make room for truth-value gluts subvaluationism needs to endorse a notion of logical consequence that is, in some sense, weaker than standard notions of consequence. But this weakness allows the subvaluationist theory to accommodate higher-order vagueness in a way that it is not available to other theories of vagueness (such as, for example, its paracomplete counterpart, supervaluationism). (shrink)

The aim of this paper is to reconstruct the research program of formal ontology developed by M. Scheler before his last 1922 theoretical shift. Scheler’s theory of dialectical negation will be also investigated. In regard to the first topic, the focus will be on the complex architecture of Scheler’s formal ontology, deepened within a theoretical framework of realistic ontology: integrated into this framework, formal ontology becomes a basic tool for building phenomenological realisms. In regard to the second topic, the (...) focus will be on the close theoretical relationship between Scheler’s mature suggestion of a phenomenological objective dialectics essence-being underlying his theory of the “functionalization of the essential knowledge” (Funktionalizierung der Wesenserkenntnis) ─ systematically presented for the first time in the 1921 work Probleme der Religion ─, and the formal ontological foundation of a logical theory of a “pluralistic” dialectical negation, that is, dually, an intuitionistic, hence paracomplete, and a paraconsistent negation. Finally, it will be introduced the basics of a semiotic interpretation of Scheler’s phenomenological formal ontology within the rigorous framework of Category Theory (TC). This interpretation “strengthens” the traditional (inter)subjective side of phenomenological analysis with a new ─ in the application suggested ─ “in the third person” objective side of semiotic analysis, that shares with the first one a common pre-logical and ante-predicative level of inquiry. (shrink)

Paraconsistent responses to vagueness are often thought to represent a revision of logical theory that is too radical to be defensible. The paracomplete logic of supervaluationism, SpV, is not only taken to be more conservative but is also commonly said to 'preserve classical logic'. This chapter argues that this is wrong on both counts. The paraconsistent logic SbV, or subvaluationism, is no less conservative than SpV nor more so. In the end both logics offer equally compelling theoretical approaches (...) to vagueness. Each approach is also equally objectionable, with neither providing an adequate account of vagueness, but this criticism arises from a feature shared by each approach that is independent of their paracompleteness or paraconsistency per se. For all that has been said, a paraconsistent approach, and the associated recourse to truth-value gluts, remains a contender in accounting for vagueness. (shrink)

This paper introduces the logic of evidence and truth \ as an extension of the Belnap–Dunn four-valued logic \. \ is a slightly modified version of the logic \, presented in Carnielli and Rodrigues. While \ is equipped only with a classicality operator \, \ is equipped with a non-classicality operator \ as well, dual to \. Both \ and \ are logics of formal inconsistency and undeterminedness in which the operator \ recovers classical logic for propositions in its scope. (...) Evidence is a notion weaker than truth in the sense that there may be evidence for a proposition \ even if \ is not true. As well as \, \ is able to express preservation of evidence and preservation of truth. The primary aim of this paper is to propose a probabilistic semantics for \ where statements \\) and \\) express, respectively, the amount of evidence available for \ and the degree to which the evidence for \ is expected to behave classically—or non-classically for \ \). A probabilistic scenario is paracomplete when \ + P 1\), and in both cases, \ < 1\). If \ = 1\), or \ = 0\), classical probability is recovered for \. The proposition \, a theorem of \, partitions what we call the information space, and thus allows us to obtain some new versions of known results of standard probability theory. (shrink)

This paper aims at developing a logical theory of perspectival epistemic attitudes. After presenting a standard framework for modeling acceptance, where the epistemic space of an agent coincides with a unique epistemic cell, more complex systems are introduced, which are characterized by the existence of many connected epistemic cells, and different possible attitudes towards a proposition, both positive and negative, are discussed. In doing that, we also propose some interesting ways in which the systems can be interpreted on well (...) known epistemological standpoints. (shrink)

The idea of classical recapture has played a prominent role for non-classical logicians. In the specific case of non-classical theories of truth, although we know that it is not possible to retain classical logic for every statement involving the truth predicate, it is clear that for many such statements this is in principle feasible, and even desirable. What is not entirely obvious or well-known is how far this idea can be pushed. Can the non-classical theorist retain classical logic for every (...) non-paradoxical statement? If not, is she forced to settle for a very weak form of Classical Recapture, or are there robust versions of classical recapture available to her? These are the main questions that I will address in this paper. As a test case I will consider a paracomplete account of the truth-theoretic paradoxes and I will argue for two claims. First, that it is not possible to retain the law of excluded middle for every non-paradoxical statement. Secondly, that there are no robust versions of classical recapture available to the paracomplete logician. (shrink)

Quasi-truth (a.k.a. pragmatic truth or partial truth) is typically advanced as a framework accounting for incompleteness and uncertainty in the actual practices of science. Also, it is said to be useful for accommodating cases of inconsistency in science without leading to triviality. In this paper, we argue that the formalism available does not deliver all that is promised. We examine the standard account of quasi-truth in the literature, advanced by da Costa and collaborators in many places, and argue that it (...) cannot legitimately account for incompleteness in science. We shall claim that it conflates paraconsistency and paracompleteness. It also cannot properly account for inconsistencies, because no direct contradiction of the form S ∧ ¬S can be quasi-true according to the framework; contradictions simply have no place in the formalism. Finally, we advance an alternative interpretation of the formalism in terms of dealing with distinct contexts where incompatible information is dealt with. This does not save the original program, but seems to make better sense of the apparatus. (shrink)

A key facet of Valerie Plumwood’s feminist critique of logic is her analysis of classical negation. On Plumwood’s reading, the exclusionary features of classical negation generate hierarchical dualisms, i.e., dichotomies in which dominant groups’ primacy is reinforced while underprivileged groups are oppressed. For example, Plumwood identifies the system collapse following from ex contradictione quodlibet—that a theory including both φ and ∼φ trivializes—as a primary source of many of these features. Although Plumwood considers the principle of excluded middle to be (...) compatible with her goals, that she identifies relevant logics as systems lacking a hierarchical negation—whose first-degree fragments are both paraconsistent and paracomplete—suggests that excluded middle plays some role in hierarchical dualisms as well. In these notes, I examine the role of excluded middle in generating oppressive homogenization and try to clarify the relationship between Plumwood’s critique and this principle from several contemporary perspectives. Finally, I examine the matter of whether Plumwood’s critique requires relevance or whether a non-relevant logic could satisfy her criteria and serve as a liberatory logic of difference. (shrink)

The non-alethic systems N1 of da Costa and A of Grana are both paraconsistent and paracomplete. Based on them, a multi-agent doxastic logic NADK can be obtained by logical expansion. The soundness and completeness of NADK are proved and its special theorems are also presented. In this logic, the belief version of the laws of contradiction and excluded middle, as well as the principle of explosion are all invalid. Therefore, it may provide a reliable logical basis for any (...) class='Hi'>theory which has paraconsistent or paracomplete epistemic conflicts, such as true contradictions, true contrarieties, and belief paradoxes. We also explain in detail how a non-alethic doxastic logic provides a reliable logical basis for tolerating these three types of epistemic conflicts. The present paper is the deepening and development of system N1 and A. (shrink)

In this article, I develop three conceptual innovations within the area of formal metatheory, and present a computer program, called Reconstructor, that implements those developments. The first development consists in a methodology for testing formal reconstructions of scientific theories, which involves checking both whether translations of paradigmatically successful applications into models satisfy the formalisation of the laws, and also whether unsuccessful applications do not. I show how Reconstructor can help carry this out, since it allows the end-user to specify a (...) formal language, input axioms and models formulated in that language, and then ask if the models satisfy the axioms. The second innovation is the introduction of incomplete models (for which the denotation of some terms is missing) into scientific metatheory, in order to represent cases of missing information. I specify the paracomplete semantics built into Reconstructor to deal with sentences where denotation failures occur. The third development consists in a new way of explicating the structuralist notion of a determination method, by equating them with algorithms. This allows determination methods to be loaded into Reconstructor and then executed within a model to find out the value of a previously non-denoting term (i.e. it allows the formal reconstruction to make predictions). This, in turn, can help test the reconstruction in a different way. Finally, I conclude with some suggestions about additional uses the program may have. (shrink)

Propositions are central to at least most theorizing about the connection between our mental lives and the world: we use them in our theories of an array of attitudes including belief, desire, hope, fear, knowledge, and understanding. Unfortunately, when we press on these theories, we encounter a relatively neglected family of paradoxes first studied by Arthur Prior. I argue that these paradoxes present a fatal problem for most familiar resolutions of paradoxes. In particular, I argue that truth-value gap, contextualist, situation (...) theoretic, revision theoretic, ramified, and dialetheist approaches to the paradoxes must deny us the conceptual resources that they themselves make use of, on pain of contradiction. I then detail the costs of the extant strategies that avoid this issue: Hartry Field’s paracomplete approach; Andrew Bacon’s classical treatment of indeterminacy; a generalization of ideas from Prior, Nicholas J.J. Smith, and Hartley Slater; and free logics as recently explored by Bacon, John Hawthorne, and Gabriel Uzquiano. I argue that none of these is perfect, and that each restricts the theories we can endorse in a variety of areas of philosophy. I spell these restrictions out, showing, I hope, that the further investigation of these paradoxes must be a part of future research on propositional attitudes. (shrink)

We investigate some non-normal variants of well-studied paraconsistent and paracomplete modal logics that are based on N. Belnap’s and M. Dunn’s four-valued logic. Our basic non-normal modal logics are characterized by a weak extensionality rule, which reflects the four-valued nature of underlying logics. Aside from introducing our basic framework of bi-neighbourhood semantics, we develop a correspondence theory in order to prove completeness results with respect to our neighbourhood semantics for non-normal variants of \, \ and \.

In 2016, Béziau introduces a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws $\varphi,\neg \varphi \vdash \psi$ and $\vdash \neg (\varphi \wedge \neg \varphi)$. In that paper, the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above-mentioned are $\vdash \varphi, \neg \varphi$ and $\neg (\varphi \vee \neg \varphi) \vdash$. We call genuine paracomplete logics those (...) rejecting the mentioned properties. We present here an analysis of the three-valued genuine paracomplete logics. A very natural twist structures semantics for these logics is also found in a systematic way. This semantics produces automatically a simple and elegant Hilbert-style characterization for all these logics. Finally, we introduce the logic LGP which is genuine paracomplete is not genuine paraconsistent, not even paraconsistent and cannot be characterized by a single finite logical matrix. (shrink)

This paper contributes to the study of paracompleteness and paraconsistency. We present two logics that address the following questions in novel ways. How can the paracomplete theorist characterize the formulas that defy excluded middle while maintaining that not all formulas are of this kind? How can the paraconsistent theorist characterize the formulas that obey explosion while still maintaining that there are some formulas not of this kind?

Jaśkowski's discussive (discursive) logic D2 is historically one of the first paraconsistent logics, i.e., logics which 'tolerate' contradictions. Following Jaśkowski's idea to define his discussive logic by means of the modal logic S5 via special translation functions between discussive and modal languages, and supporting at the same time the tradition of paracomplete logics being the counterpart of paraconsistent ones, we present a paracomplete discussive logic D2p.