It is shown that logical contradictions are derivable from natural translations into first order logic of the description and background assumptions of the Soros Game, and of other games and social contexts that exhibit conflict and reflexivity. The logical structure of these contexts is analysed using proof-theoretic and model-theoretic techniques of first order paraconsistent logic. It is shown that all the contradictions that arise contain the knowledge operator K. Thus, the contradictions do not refer purely to material objects, and do (...) not imply the existence of inconsistent, concrete, physical objects, or the inconsistency of direct sensory experience. However, the decision-making of rational self-interested agents is stymied by the appearance of such intensional contradictions. Replacing the rational self-interest axioms with axioms for an appropriate moral framework removes the inconsistencies. Rational moral choice in conflict-reflexive social contexts then becomes possible. (shrink)

In “The Runabout Inference Ticket” AN Prior (1960) examines the idea that logical connectives can be given a meaning solely in virtue of the stipulation of a set of rules governing them, and thus that logical truth/consequence.

In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classical notion, and two dual notions simultaneously defined in terms of it, (...) which we call tolerant truth and strict truth. We characterize the space of consequence relations definable in terms of those and discuss the kind of solution this gives to the sorites paradox. We discuss some applications of the framework to the pragmatics and psycholinguistics of vague predicates, in particular regarding judgments about borderline cases. (shrink)

In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the strict-tolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+’s external logic and they question whether ST+’s solution to the semantic paradoxes is fundamentally different from LP+’s. Here we establish that by parity of reasoning, ST+ can be related to LP+’s dual logic K3+. We clarify the distinction between internal and external logic and (...) argue that while ST+’s nonclassicality can be granted, its self-dual character does not tie it to LP+ more closely than to K3+. (shrink)

In this note, I present a modified semantic framework for the multi-valued paraconsistent logic LP, which allows for a straightforward preservation of a significant classical intuition about negation, namely that the negation operator reverses truth-value.

In this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some of the three properties, namely subclassicality and two properties that we call fixed-point negation property (...) and conservativeness. In the second part of the paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively. (shrink)

There are several three-valued logical systems that form a scattered landscape, even if all reasonable connectives in three-valued logics can be derived from a few of them. Most papers on this subject neglect the issue of the relevance of such logics in relation with the intended meaning of the third truth-value. Here, we focus on the case where the third truth-value means unknown, as suggested by Kleene. Under such an understanding, we show that any truth-qualified formula in a large range (...) of three-valued logics can be translated into KD as a modal formula of depth 1, with modalities in front of literals only, while preserving all tautologies and inference rules of the original three-valued logic. This simple information logic is a two-tiered classical propositional logic with simple semantics in terms of epistemic states understood as subsets of classical interpretations. We study in particular the translations of Kleene, Gödel, ᴌukasiewicz and Nelson logics. We show that Priest’s logic of paradox, closely connected to Kleene’s, can also be translated into our modal setting, simply by exchanging the modalities possible and necessary. Our work enables the precise expressive power of three-valued logics to be laid bare for the purpose of uncertainty management. (shrink)

We present a paraconsistent logic, called Z, based on an intuitive possible worlds semantics, in which the replacement theorem holds. We show how to axiomatize this logic and prove the completeness theorem.

Paraconsistent Weak Kleene logic is the 3-valued logic with two designated values defined through the weak Kleene tables. This paper is a first attempt to investigate PWK within the perspective and methods of abstract algebraic logic. We give a Hilbert-style system for PWK and prove a normal form theorem. We examine some algebraic structures for PWK, called involutive bisemilattices, showing that they are distributive as bisemilattices and that they form a variety, \, generated by the 3-element algebra WK; we also (...) prove that every involutive bisemilattice is representable as the Płonka sum over a direct system of Boolean algebras. We then study PWK from the viewpoint of AAL. We show that \ is not the equivalent algebraic semantics of any algebraisable logic and that PWK is neither protoalgebraic nor selfextensional, not assertional, but it is truth-equational. We fully characterise the deductive filters of PWK on members of \ and the reduced matrix models of PWK. Finally, we investigate PWK with the methods of second-order AAL—we describe the class \ of PWK-algebras, algebra reducts of basic full generalised matrix models of PWK, showing that they coincide with the quasivariety generated by WK—which differs from \—and explicitly providing a quasiequational basis for it. (shrink)

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)

A common and much-explored thought is Łukasiewicz's idea that the future is ‘indeterminate’—i.e., ‘gappy’ with respect to some claims—and that such indeterminacy bleeds back into the present in the form of gappy ‘future contingent’ claims. What is uncommon, and to my knowledge unexplored, is the dual idea of an overdeterminate future—one which is ‘glutty’ with respect to some claims. While the direct dual, with future gluts bleeding back into the present, is worth noting, my central aim is simply to sketch (...) and briefly explore an alternative glutty-future view, one that is conservative—indeed, entirely classical—with respect to the present. The structure of the paper runs as follows. §1 briefly sketches the target gap picture of an indeterminate future yielding gappy claims at the present. §2 presents the direct dual idea—a glut picture of an overdeterminate future yielding glutty claims at present. §3 sketches the central idea, a more interesting glut picture in which the future contains contradictory states but the present remains entirely classical. §4 contains a general defence of the idea, leaving it open as to whether the gappy-future view enjoys substantive virtues over the proposed glutty-future view of §3. (shrink)

A quasi-canonical Gentzen-type system is a Gentzen-type system in which each logical rule introduces either a formula of the form , or of the form , and all the active formulas of its premises belong to the set . In this paper we investigate quasi-canonical systems in which exactly one of the two classical rules for negation is included, turning the induced logic into either a paraconsistent logic or a paracomplete logic, but not both. We provide a constructive coherence criterion (...) for such systems, and show that a quasi-canonical system of the type we investigate is coherent iff it is strongly paraconsistent or strongly paracomplete (in a sense defined in the paper), iff it has a trivalent, non-deterministic semantics of a special type (also defined in the paper) for which it is sound and complete. Finally, we determine when a system of this sort admits cut-elimination, and provide a simple procedure for transforming one which does not into one which does. (shrink)

We define in precise terms the basic properties that an ‘ideal propositional paraconsistent logic’ is expected to have, and investigate the relations between them. This leads to a precise characterization of ideal propositional paraconsistent logics. We show that every three-valued paraconsistent logic which is contained in classical logic, and has a proper implication connective, is ideal. Then we show that for every n > 2 there exists an extensive family of ideal n -valued logics, each one of which is not (...) equivalent to any k -valued logic with k < n. (shrink)

Some scientific theories are inconsistent, yet non-trivial and meaningful. How is that possible? The present paper aims to show that we can analyse the inferential use of such theories in terms of consistent compositions of the applications of universal axioms. This technique will be represented by a preferred models semantics, which allows us to accept the instances of universal axioms selectively. For such a semantics to be developed, the framework of partial structures by da Costa and French will be extended (...) by a few elements of the Sneed formalism, also known as the structuralist approach to science. (shrink)

In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...) of our PIF account of truth-talk, we demonstrate a few advantages it offers over T-deflationist accounts that do not explicitly acknowledge pretense at work in the discourse. In turning to the Liar Paradox, we explain how the quasi-anaphoric functioning that our account attributes to truth-talk provides a diagnosis of the Liar Paradox (and other instances of semantic pathology) as having no content—in the sense of not specifying any of what we call M-conditions. At the same time, however, we vindicate the intuition that we can understand liar sentences, thereby avoiding one standard objection to “meaningless strategy” responses to the Liar Paradox. With this diagnosis in place, we then, by way of treatment, introduce a new predicate, ‘semantically defective’, and show how the explanation we give for its application allows for a consistent, yet revenge-immune, (dis)solution of the Liar Paradox, and semantic pathology generally. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

The present contribution might be regarded as a kind of defense of the common sense in logic. It is demonstrated that if the classical negation is interpreted as the minimal negation with n = 2 truth values, then deviant logics can be conceived as extension of the classical bivalent frame. Such classical apprehension of negation is possible in non- classical logics as well, if truth value is internalized and bivalence is replaced by bipartition.

By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also contains a host of unfamiliar (...) logics. We first study the members of our class semantically, after which we present a uniform sequent calculus that is sound and complete with respect to all of them. Two further sequent calculi and \ calculus) will be considered, which serve the same purpose and which are obtained by applying general methods to construct sequent calculi for many-valued logics. Rules and proofs in the SK calculus are much simpler and shorter than those of the \ and the \ calculus, which is one of the reasons to prefer the SK calculus over the latter two. Besides favourably comparing the SK calculus to both the \ and the \ calculus, we also hint at its philosophical significance. (shrink)

The semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these logics to more expressive languages. We do so by relying on the \ calculus, a signed tableau calculus whose rules mirror the Dunn conditions syntactically and which characterizes the Dunn logics in a uniform way. In (...) terms of the \ calculus, we first introduce two different interpolation methods, each of which uniformly shows that the Dunn logics have the interpolation property. One of the methods is closely related to Maehara’s method but the other method, which we call the pruned tableau method, is novel to this paper. We provide various reasons to prefer the pruned tableau method to the Maehara-style method. We then turn our attention to extensions of Dunn logics with so-called appropriate implication connectives. Although these logics have been considered at various places in the literature, a study of the interpolation properties of these logics is lacking. We use the pruned tableau method to uniformly show that these extended Dunn logics have the interpolation property and explain that the same result cannot be obtained via the Maehara-style method. Finally, we show how the pruned tableau method constructs interpolants for functionally complete extensions of the Dunn logics. (shrink)

ABSTRACTDo truth tables—the ordinary sort that we use in teaching and explaining basic propositional logic—require an assumption of consistency for their construction? In this essay we show that truth tables can be built in a consistency-independent paraconsistent setting, without any appeal to classical logic. This is evidence for a more general claim—that when we write down the orthodox semantic clauses for a logic, whatever logic we presuppose in the background will be the logic that appears in the foreground. Rather than (...) any one logic being privileged, then, on this count partisans across the logical spectrum are in relatively similar dialectical positions. (shrink)

This article focuses on defective conditionals ? namely indicative conditionals whose antecedents are false and whose truth-values therefore cannot be determined. The problem is to decide which formal connective can adequately represent this usage. Classical logic renders defective conditionals true whereas traditional mathematics dismisses them as irrelevant. This difference in treatment entails that, at the propositional level, classical logic validates some sentences that are intuitively false in plane geometry. With two proofs, I show that the same flaw is shared by (...) a family of trivalent logics. I go on to examine the strict conditional and its derivatives. This family is the only one to avoid the faulty inference but it does so without addressing the status of the truth-value assigned to defective conditionals. (shrink)

Abstract. As a general theory of reasoning—and as a general theory of what holds true under every possible circumstance—logic is supposed to be ontologically neutral. It ought to have nothing to do with questions concerning what there is, or whether there is anything at all. It is for this reason that traditional Aristotelian logic, with its tacit existential presuppositions, was eventually deemed inadequate as a canon of pure logic. And it is for this reason that modern quantification theory, too, with (...) its residue of existentially loaded theorems and patterns of inference, has been claimed to suffer from a defect of logical purity. The law of non-contradiction rules out certain circumstances as impossible—circumstances in which a statement is both true and false, or perhaps circumstances where something both is and is not the case. Is this to be regarded as a further ontological bias? (shrink)

Four known three-valued logics are formulated axiomatically and several completeness theorems with respect to nonstandard intuitive semantics, connected with the notions of information, contrariety and subcontrariety is given.

The claim that nature is self-consistent has recently been contested by a number of paraconsistent logicians. In this paper I will survey the arguments which paraconsistent logicians have presented for the thesis that nature is actually inconsistent. My conclusion is that these arguments all fail.The paraconsistency programme has to date been concerned primarily with outlining the philosophical inadequacy of classical logic, and detailed discussions of issues bearing upon the philosophical adequacy of the paraconsistency position itself are not to be found (...) as yet in the literature. This inadequacy will be illustrated here with respect to the question of the self-consistency of nature. (shrink)

This is a philosophical and historical investigation of the role of inconsistent representations of the same scientific phenomenon. The logical difficulties associated with the simultaneous application of inconsistent models are discussed. Internally inconsistent scientific proposals are characterized as structures whose application is necessarily tied to the confirming evidence that each of its components enjoys and to a vision of the general form of the theory that will resolve the inconsistency. Einstein's derivation of the black body radiation law is used as (...) an example application of such a strategy and is contrasted with planck's derivation. (shrink)

Francesco Berto has recently written “The Gödel Paradox and Wittgenstein's Reasons,” about a paradox first formulated by Graham Priest in 1971. The major reason for disagreeing with Berto's conclusions concerns his elucidation of Wittgenstein's understanding of Gödel's theorems. Seemingly, Wittgenstein was some kind of proto-paraconsistentist. Priest himself has also, though in a different way, tried to tar Wittgenstein with the same brush. But the resolution of other paradoxes is intimately linked with the resolution of the Gödel Paradox, and with understanding (...) Wittgenstein's views of Gödel's theorems. So this paper discusses some other paradoxes before looking at Wittgenstein's relevant views. (shrink)

In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets of (...) higher-order values. This method is based on the concept of a multilattice. If the method is applied to the set of truth values of Belnap's “useful four-valued logic”, one obtains a trilattice, and, more generally, structures here called Belnap-trilattices. As in Priest's case, it is shown that the generalized truth values motivated by hyper-contradictions have no effect on the logic. Whereas Priest's construction in terms of designated truth values always results in his Logic of Paradox, the present construction in terms of truth and falsity orderings always results in First Degree Entailment. However, it is observed that applying the multilattice-approach to Priest's initial set of truth values leads to an interesting algebraic structure of a “bi-and-a-half” lattice which determines seven-valued logics different from Priest's Logic of Paradox. (shrink)

Deleuze never explicitly formulates his philosophy of logical truth‐values. It thus remains an open question as to the number and types he held there to be. Despite his explicit comments on these matters, additional textual evidence suggests that in his thinking on the event, he favored a third truth‐value, holding either the analetheic view that some truth‐bearers can be truth‐valueless or the dialetheic view that some truth‐bearers can be both true and false. I first argue that taking a logical approach (...) to Deleuze's thinking is feasible, despite his and others' claims that might suggest otherwise. Next, I examine his explicit statements to show that they cannot be taken at face value and that, rather, we need to transpose his claims into contemporary terminology in order to accurately assess them. I lastly turn to his Leibniz‐inspired philosophy of time to argue that the affirmations involved in this conception strongly suggest a dialetheic tendency in his thinking. (shrink)

In Sect. 1 it is argued that systems of logic are exceptional, but not a priori necessary. Logics are exceptional because they can neither be demonstrated as valid nor be confirmed by observation without entering a circle, and their motivation based on intuition is unreliable. On the other hand, logics do not express a priori necessities of thinking because alternative non-classical logics have been developed. Section 2 reflects the controversies about four major kinds of non-classical logics—multi-valued, intuitionistic, paraconsistent and quantum (...) logics. Its purpose is to show that there is no particular domain or reason that demands the use of a non-classical logic; the particular reasons given for the non-classical logic can also be handled within classical logic. The result of Sect. 2 is substantiated in Sect. 3, where it is shown (referring to other work) that all four kinds of non-classical logics can be translated into classical logic in a meaning-preserving way. Based on this fact a justification of classical logic is developed in Sect. 4 that is based on its representational optimality. It is pointed out that not many but a few non-classical logics can be likewise representationally optimal. However, the situation is not symmetric: classical logic has ceteris paribus advantages as a unifying metalogic, while non-classical logics can have local simplicity advantages. (shrink)

In this paper a new conception of foundation-oriented epistemology is developed. The major challenge for foundation-oriented justifications consists in the problem of stopping the justificational regress without taking recourse to dogmatic assumptions or circular reasoning. Two alternative accounts that attempt to circumvent this problem, coherentism and externalism, are critically discussed and rejected as unsatisfactory. It is argued that optimality arguments are a new type of foundation-oriented justification that can stop the justificational regress. This is demonstrated on the basis of a (...) novel result in the area of induction: the optimality of meta-induction. In the final section the method of optimality justification is generalized to deductive and abductive inferences. (shrink)

In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are demonstrably without epistemic value. Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus non-classical logics. In this paper the question is answered positively, based on meaning-preserving translations between logical systems. It is demonstrated that major systems of non-classical logic, including multi-valued, paraconsistent, intuitionistic and quantum logics, (...) can be translated into classical logic by introducing additional intensional operators into the language. Based on this result it is argued that classical logic is representationally optimal. In sec. 6 it is investigated whether non-classical logics can be likewise representationally optimal. The answer is predominantly negative but partially positive. Nevertheless the situation is not symmetric, because classical logic has important ceteris paribus advantages as a unifying metalogic. (shrink)

Relevantism, as a matter of definition, rejects classical logic as incorrect and adopts instead a relevant logic as encapsulating correct inference. It rejects classical logic on the grounds that the rule of Material Detachment, from A and not A or B to infer B,, sometimes leads from truth to falsity. Relevantism — although promoted by some relevant logicians, and an integral part of ultralogic — has recently encountered heavy, but interesting, criticism from relevance logicians themselves.

Paraconsistent and dialetheist approaches to a theory of truth are faced with a problem: the expressive resources of the logic do not suffice to express that a sentence is just true—i.e., true and not also false—or to express that a sentence is consistent. In his recent book, Spandrels of Truth, Jc Beall proposes a ‘just true’-operator to identify sentences that are true and not also false. Beall suggests seven principles that a ‘just true’-operator must fulfill, and proves that his operator (...) indeed fulfills all of them. He concludes that just true has been expressed in the language. I argue that, while the seven conditions may be necessary for an operator to express just true, they are not jointly sufficient. Specifically, first, I prove that a further plausible desideratum for necessary conditions on ‘just true’ is not fulfilled by Beall's proposal, namely that ‘just true’ ascriptions should themselves be just true, and not also false (or equivalently, that the ‘just true’-operator iterates). Second, I show that Beall's operator does not adequately express just true, but that it merely captures an arbitrary proper subset of the just true sentences. Further, there is no prospect of extending the proposal in order to encompass a more reasonable subset of the just true sentences without presupposing that we have antecedent means to characterize the class of just true sentences. (shrink)

Let MK3 I and MK3 II be Kleene's strong 3-valued matrix with only one and two designated values, respectively. Next, let MK3 G be defined exactly as MK3 I, except th...

The present paper is a sequel to Robles et al. :349–374, 2020. https://doi.org/10.1007/s10849-019-09306-2). A class of implicative expansions of Kleene’s 3-valued logic functionally including Łukasiewicz’s logic Ł3 is defined. Several properties of this class and/or some of its subclasses are investigated. Properties contemplated include functional completeness for the 3-element set of truth-values, presence of natural conditionals, variable-sharing property and vsp-related properties.

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite logical (...) matrix. We show that the last logic of the chain is not finitely axiomatisable. (shrink)

In some logics, anything whatsoever follows from a contradiction; call these logics explosive. Paraconsistent logics are logics that are not explosive. Paraconsistent logics have a long and fruitful history, and no doubt a long and fruitful future. To give some sense of the situation, I’ll spend Section 1 exploring exactly what it takes for a logic to be paraconsistent. It will emerge that there is considerable open texture to the idea. In Section 2, I’ll give some examples of techniques for (...) developing paraconsistent logics. In Section 3, I’ll discuss what seem to me to be some promising applications of certain paraconsistent logics. In fact, however, I don’t think there’s all that much to the concept ‘paraconsistent’ itself; the collection of paraconsistent logics is far too heterogenous to be very productively dealt with under a single label. Perhaps that will emerge as we go. (shrink)

This paper gives an outline of three different approaches to the four-valued semantics for relevant logics (and other non-classical logics in their vicinity). The first approach borrows from the 'Australian Plan' semantics, which uses a unary operator '⋆' for the evaluation of negation. This approach can model anything that the two-valued account can, but at the cost of relying on insights from the Australian Plan. The second approach is natural, well motivated, independent of the Australian Plan, and it provides a (...) semantics for the contraction-free relevant logic C (or RW). Unfortunately, its approach seems to model little else. The third approach seems to capture a wide range of formal systems, but at the time of writing, lacks a completeness proof. (shrink)

The present paper concerns a technical study of PRIEST'S logic of paradox [Pri 79], We prove that this logic has no proper paraconsistent strengthening. It is also proved that the mentioned logic is the largest paraconsistent one satisfaying TARSKI'S conditions for the classical conjunction and disjunction together with DE MORGAN'S laws for negation. Finally, we obtain for the logic of paradox an algebraic completeness result related to Kleene lattices.

Classical propositional logic can be characterized, indirectly, by means of a complementary formal system whose theorems are exactly those formulas that are not classical tautologies, i.e., contradictions and truth-functional contingencies. Since a formula is contingent if and only if its negation is also contingent, the system in question is paraconsistent. Hence classical propositional logic itself admits of a paraconsistent characterization, albeit “in the negative”. More generally, any decidable logic with a syntactically incomplete proof theory allows for a paraconsistent characterization of (...) its set of theorems. This, we note, has important bearing on the very nature of paraconsistency as standardly characterized. (shrink)

The paper concerns time, change and contradiction, and is in three parts. The first is an analysis of the problem of the instant of change. It is argued that some changes are such that at the instant of change the system is in both the prior and the posterior state. In particular there are some changes from p being true to p being true where a contradiction is realized. The second part of the paper specifies a formal logic which accommodates (...) this possibility. It is a tense logic based on an underlying paraconsistent prepositional logic, the logic of paradox. (See the author's article of the same name Journal of Philosophical Logic 8 (1979).) Soundness and completeness are established, the latter by the canonical model construction, and extensions of the basic system briefly considered. The final part of the paper discusses Leibniz's principle of continuity: Whatever holds up to the limit holds at the limit. It argues that in the context of physical changes this is a very plausible principle. When it is built into the logic of the previous part, it allows a rigorous proof that change entails contradictions. Finally the relation of this to remarks on dialectics by Hegel and Engels is briefly discussed. (shrink)

This paper argues for tlie claims that a) a natural language such as English is semanticaly closed b) semantic closure implies inconsistency. A corollary of these is that the semantics of English must be paraconsistent. The first part of the paper formulates a definition of semantic closure which applies to natural languages and shows that this implies inconsistency. The second section argues that English is semeantically closed. The preceding discussion is predicated on the assumption that there are no truth value (...) gaps. The next section of the paper considers whether the possibility of these makes any difference to the substantive conclusions of the previous sections, and argues that it does not. The crux of the preceding arguments is that none of the consistent semantical accounts that have been offered for solving the semantical paradoxes is a semantic ofEnglish. The final section of the paper produces a general argument as to why this must always be the case. (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)