A modal theorem-preserving translation of a class of three-valued logics of incomplete information

International audienceThere 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

The Class of All Natural Implicative Expansions of Kleene’s Strong Logic Functionally Equivalent to Łukasiewicz’s 3-Valued Logic Ł3

25 p.We consider the logics determined by the set of all natural implicative expansions of Kleene’s strong 3-valued matrix (with both only one and two designated values) and select the class of all logics functionally equivalent to Łukasiewicz’s 3-valued logic Ł3. The concept of a “natural implicative matrix” is based upon the notion of a “natural conditional” defined in Tomova (Rep Math Log 47:173–182, 2012).S

A simple Henkin-style completeness proof for Gödel 3-valued logic G3

A simple Henkin-style completeness proof for Gödel 3-valued propositional logic G3 is provided. The idea is to endow G3 with an under-determined semantics (u-semantics) of the type defined by Dunn. The key concept in u-semantics is that of “under-determined interpretation” (u-interpretation). It is shown that consistent prime theories built upon G3 can be understood as (canonical) u-interpretations. In order to prove this fact we follow Brady by defining G3 as an extension of Anderson and Belnap’s positive fragment of First Degree Entailment Logic

Partial and paraconsistent three-valued logics

On the sidelines of classical logic, many partial and paraconsistent three-valued logics have been developed. Most of them differ in the notion of logical consequence or in the definition of logical connectives. This article aims, firstly, to provide both a model-theoretic and a proof-theoretic unified framework for these logics and, secondly, to apply these general frameworks to several well-known three-valued logics. The proof-theoretic approach to which we give preference is sequent calculus. In this perspective, several results concerning the properties of functional completeness, cut redundancy, and proof-search procedure are shown. We also provide a general proof for the soundness and the completeness of the three sequent calculi discussed

Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis

Using the method of correspondence analysis, Tamminga obtains sound and complete natural deduction systems for all the unary and binary truth-functional extensions of Kleene’s strong three-valued logic K3 . In this paper, we extend Tamminga’s result by presenting an original finite, sound and complete proof-searching technique for all the truth-functional binary extensions of K3

Normalisation for Some Quite Interesting Many-Valued Logics

In this paper, we consider a set of quite interesting three- and four-valued logics and prove the normalisation theorem for their natural deduction formulations. Among the logics in question are the Logic of Paradox, First Degree Entailment, Strong Kleene logic, and some of their implicative extensions, including RM3 and RM3⊃. Also, we present a detailed version of Prawitz’s proof of Nelson’s logic N4 and its extension by intuitionist negation

Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix II. Only one designated value

21 p.This paper is a sequel to ‘Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values’, where a ‘bivalent’ Belnap-Dunn semantics is provided for all the expansions referred to in its title. The aim of the present paper is to carry out a parallel investigation for all natural implicative expansions of Kleene's strong 3-valued matrix now with only one designated value.S

Partiality and its dual in natural implicative expansions of Kleene’s strong 3-valued matrix with only one designated value

26 p.Equivalent overdetermined and underdetermined bivalent Belnap–Dunn type semantics for the logics determined by all natural implicative expansions of Kleene’s strong 3-valued matrix with only one designated value are provided.S

G'3 as the logic of modal 3-valued Heyting algebras

In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one of Gödel 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained

Rethinking inconsistent mathematics

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 rolee of logic and ethics in the practice of mathematics