Preprint
Article

This version is not peer-reviewed.

Cut Elimination Versus Logic of Paradox

Submitted:

02 July 2025

Posted:

03 July 2025

You are already at the latest version

Abstract
A Cut-/Reflexivity-free version LK-C/R of the propositional fragment of Gentzen calculus LK for the classical propositional logic PC endowed with propositional rules inverse to its logical ones as well as rules of constant elimination is proved to be equivalent to the bounded version of the ``logic of paradox''/``Kleene three-valued logic''\/} LP01/K301 under the standard interpretation of propositional sequents by propositional clauses and inverse interpretation of propositional formulas by premise-less single-conclusion sequents, ``with same theorems as PC, implying that LK has same derivable sequents as LK^-C, and so yielding a new semantic insight into Cut Elimination in LK''/. As a by-product of the discovered equivalence and absence of proper consistent extensions of LP01/K301 other than PC ``and that relatively axiomatized by the Ex Contradictione Quodlibet rule''/, proved here upon the basis of the universal algebraic technique elaborated in an earlier work of ours, we prove that LK-C/R has no proper consistent extension other than LK ``and the one relatively axiomatized by the context-free restriction of Cut''/.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

According to [14], the constant-free propositional empty-sequent-less fragment of L K [4] endowed with rules inverse to logical ones is equivalent (in the sense of [11]) to the logic of paradox  L P [9], having the same theorems as the classical propositional logic P C , in view of [13], that has yielded both a novel semantic insight into Cut Elimination in L K and the fact that the only proper consistent extension of the sequent calculus involved distinct from L K is the one relatively axiomatized by Cut with minimal non-empty context (viz., having just a single formula either on the right or on the left but not on both sides). The primary objective of this work is to expand [14] to the full propositional fragment of L K upon proper expanding underlying works [10,13].
The rest of the work is as follows. Section 2 is a brief summary of basis issues underlying the work. Section 3 is devoted to key universal issues, then used in the main part presented in Section 4.

2. General background

2.1. Set-theoretical background

Non-negative integers are identified with sets/ ordinals of lesser ones, their set/ordinal being denoted by ω . Unless any confusion is possible, one-element/-component sets/sequences are identified with their elements/components. As usual, functions are treated as binary relations.
Given any sets A, B and an infix : A 2 A , let ( ω ) ( [ B , ] A ) be the set of all (finite) subsets of A [including B], ϵ A { a , a a A } the equality relation on A, A * | + ( m ( ω ( 0 | 1 ) ) A m ) and + : A + A , { a ¯ , b , } c ( { + ( a ¯ , b ) } c ) , while A-tuples 〈viz., functions with domain A are written in the sequence form t ¯ with t a , where a A , stands for π a ( t ¯ ) , as well as, in case A = ( [ n + ] 1 ) [where n ω ] written also in the standard finite tuple/sequence form [ ( ) ] t 0 [ { , } { , } t n ( ) ] [and identified with t ¯ n , t n ] under identification of B [ n + ] 1 with [ B n × ] B whereas * : ( A * ) 2 A * , a ¯ , b ¯ ( a ¯ ( ( ( ( + ( dom a ¯ ) ) ) ( dom b ¯ ) ) 1 b ¯ ) ) the concatenation binary operation.
An X Y ( A ) is said to be meet-irreducible in Y, if Z ( Y ) : ( ( A ( Z ) ) = X ) ( X Z ) , their set being denoted by MI ( Y ) . A U ( A ) is said to be upward-directed, if S ω ( U ) : T ( U ( S , A ) ) , subsets of ( A ) closed under unions of upward directed subsets being called inductive. A [finitary] closure operator over A is any unary operation on ( A ) such that X ( A ) , Y ( X ) : ( X C ( C ( X ) ) C ( Y ) ) C ( X ) [ = ( C [ ω ( X ) ] ) ] . A closure system over A is any {〈inductive〉} C ( A ) containing A and closed under intersections of subsets containing A, any B ( A ) {such that C = { A ( S ) S B } being called a (closure) basis of  C and} determining the {〈finitary〉} closure operator C B { Z , A ( ( B ( Z , A ) ) ) Z ( A ) } { = C C } over A such that B ( img C B ) { = C } . Conversely, img C is a[n inductive] closure system over A such that C img C = C , C and img C being called dual to one another.
Remark 1.  
Due to Zorn Lemma, according to which any non-empty inductive set has a maximal element, MI ( C ) is a basis of any inductive closure system C . □
A [dual] Galois connection/retraction between/of a poset Q = Q ,  and/onto a poset P = P , is any f , g ( Q P × P Q ) such that:
( a c ) ( f ( c ) [ 1 ] f ( a ) ) ,
( b [ 1 ] d ) ( g ( d ) g ( b ) ) ,
( a g ( b ) ) ( b / a ) [ 1 ] / ( f ( a ) / g ( b ) ) ,
( f ( a ) / b ) = / [ 1 ] f ( g ( f ( a ) / b ) ) ,
g ( f ( g ( b ) / a ) ) = ( g ( b ) / a ) ,
for all a , c P and b , d Q , [dual] Galois retractions of Q onto P being exactly [dual] Galois connections between Q and P with either injective left or surjective right component.

2.2. Algebraic background

Unless otherwise specified, we deal with a fixed but arbitrary finitary algebraic (viz., functional) signature L, viewed as a propositional language consisting of (propositional) connectives, L-algebras/“their carriers|class” being denoted by “/respective capital Fraktur/Italic letters [with /same indices], unless otherwise specified” | A L . Then, Tm L { α } {where α ( ( ω ( 1 ) ) | { ω } ) (unless L has a constant)|} is the set of L-terms, viewed as 〈propositional〉L-formulas, with ⌈propositional⌉ variables in Var { α } ( img x ¯ { α } ) , where x ¯ { α } { i , x i i ( ω { α } ) } , viz., the carrier of the absolutely-free L-algebra Tm L { α } , freely-generated by Var { α } |{whose endomorphisms are viewed as ⌊propositional⌋L-substitutions, their set being denoted by Sb L σ + n [ x j / x j + n ] j ω , where n ω }. Any m-ary connective c L , where m ω , is identified with c ( x ¯ m ) Tm L m . As usual, the class of all “isomorphic copies”/subalgebras/“[ultra-]products of tuples” of members of a K A L is denoted by ( I / S / P [ U ] ) K .

2.3. Logical background

Here, we mainly follow [11] but allow infinitary logics and calculi as well as adopt more conventional terminology and notations.
Let F = L , P be a [first-order] language (viz., finitary signature), where P is a relational one, any σ Sb L being extended to the equally-denoted unary operation on the set Fm F | L | P of F-formulas/-axioms (viz., first-order atomic formulas of the signature F with variables in Var) via setting σ ( Φ ) p ( φ ¯ σ ) , for all Φ = p ( φ ¯ ) Fm F . Then, any R = Γ , Ψ Ru F [ ω ] ( [ ω ] ( Fm F ) × Fm F ) is called a (non-axiomatic∥proper) [finitary] F-rule with “elements of Γ ”/ Ψ called its premises/conclusion, written as (either Γ Φ or Γ ) Φ and identified with 〈the universal closure of〉 ( ( Γ ) ) Φ (iff Γ ), those of the form Ψ Υ , where Υ Γ , being said to be inverse to  R , while any f : Fm F [ ω ] ( Fm F ) ⌊where F = L , P is a language⌋ is extended to the equally-denoted f : Ru F [ ω ] [ ω ] ( Ru F [ ω ] ) via setting f ( R ) ( { f [ Γ ] } × f ( Φ ) ) under proper identifying singletons with their elements in the non- -optional case covering L-substitutions, whereas sets of {non-proper} [finitary] F-rules are called {axiomatic} “[finitary] F-calculi”[/“deductive bases over F”] [/[11].
A closure operator C [with non-one-element range-image] over Fm F is said to be structural, if, for all σ Sb L and X Fm F , σ [ C ( X ) ] C ( σ [ X ] ) , i.e., img C is closed under inverse substitutions in the sense that, for all σ Sb L and T ( img C ) , σ 1 [ T ] ( img C ) , in which case it is called a [consistent] F-logic(al system) {satisfying an F-rule Γ , Φ , if Φ C ( Γ ) }, elements of Thm ( C ) C ( ) being called its theorems, while any F-logic C such that ( img C ) [ = ( ( img C ) ( Thm ( C ) , Fm F ) ) ] ( img C ) { ( img C ) } is said to be an [axiomatic] {proper} extension of C, F-logics forming a complete lattice poset under extension partial ordering ≦, intersection of dual closure systems as join and point-wise intersection of F-logics as meet, whereas C is an extension of the theorem-less F-logic C + 0 dual to the closure system ( img C ) 1 over Fm F , called the theorem-less version of C. Then, the least F-logic Cn C [ C ] [being an extension of C and] satisfying all rules in a (finitary) F-calculus C is said to be axiomatized by  C [relatively toC] ( Cn C being finitary), in which case C is axiomatized by the set of all {finitary} F-rules satisfied in it {if it is finitary}, and so C is finitary iff it is axiomatized by a finitary F-calculus, while axiomatic extensions of C are exactly its extensions relatively axiomatized by axiomatic F-calculi, whereas any F-rule Γ , Φ is satisfied in Cn C iff it is derivable in C in the sense that there is a C -derivation of Φ from  Γ , i.e., a mapping Ψ ¯ from a (finite) ordinal α , called its length, to Fm F such that Φ ( img Ψ ¯ ) and, for each β α , either Ψ β Γ or there is some Ξ Ψ ¯ [ β ] such that Ξ , Ψ β Sb L [ C ] ( { σ [ C ] σ Sb L } ) , as well as:
Cn C [ C ] + 0 = Cn C + 0 [ C + 0 ] ,
where C + 0 { Γ { Ψ } , Φ Ψ = p ( x ¯ n ) Fm P , n ω , Γ , Φ σ + n [ C ] } . Given a sublanguage  F = L , P of F, where L L and P P , the L -fragment ofC is the L -logic ( C F ) { X , C ( X ) Fm L X Fm L } .

2.3.1. Basic kinds of languages

Sentential languages

Let D be a unary truth predicate relation symbol, L D L , D the sentential L-language and ( Fm | Ru ) L ( Fm | Ru ) L D “identified with Tm L under identification of any φ Tm L with D ( φ ) ”|, L D -formulas/-rules/-axioms/-calculi/-logics being called [sentential] L-formulas/-rules/-axioms/-calculi/-logics.
First-order L D -structures (viz., algebraic systems of the signature L D ; cf. [7]) [with truth predicate distinct from its carrier] are called [consistent] (logical) L-matrices (cf. [6]), identified with {the left components of} the couples constituted by their underlying algebras (viz., L-reducts) and truth predicates {whenever these are are empty, L-algebras being thus viewed as L-matrices with empty truth predicates} as well as denoted by capital Calligraphic letters 〈with indices〉, their underlying algebras being denoted by respective capital Gothic letters 〈with same indices〉. Any class M of L-matrices defines its L-logic Cn M dual to the closure system over Fm L with closure basis { h 1 [ D A ] A M , h hom ( Tm L , A ) } , satisfying any L-rule iff this is satisfied in M in the usual-model-theoretic sense, as well as being finitary, whenever both M and all its members are finite (cf. [6]), but, otherwise, not necessarily being so,1 such that
Cn M + 0 = Cn M { O , } ,
where O is any one-element L-algebra. Then, L-matrices defining extensions of an L-logic C are called its models, their class being denoted by Mod ( C ) .
Given L-matrices A and B , a[n] [injective] /surjective |strict homomorphism from A to/onto B is any [injective] h hom ( A , B ) such that D A | = h 1 [ D B ] and h [ A ] / = B (their set being denoted by hom [ I ] / [ I , ] S | S ( A , B ) ) |[also called an embedding/isomorphism of/from A into/onto B , A being said to be embedable/isomorphic into/to  B underh as well as, in case h = ϵ A , called a∥the submatrix∥restriction of B ∥“onA with setting ( B A ) A ”], in which case
hom ( Tm L , B ) / = { g h g hom ( Tm L , A ) } ,
and so:
Cn ( B / A ) | A ( | Γ ) / ( | = ) Cn B ( | Γ ) ,
for all Γ Fm L .

Equational languages

Let ≈ be an infix binary equality relation symbol, L L , the equational L-language and Eq L Fm L the set of L-equations/-identities identified with Fm L 2 under identification of any ϕ ψ with ϕ , ψ , L -rules/-axioms/-calculi/-logics being called equational L-rules/-axioms/-calculi/-logics. Then, given a class K of L-algebras, we have the equational L-logic Cn K dual to the closure system over Eq L with closure basis { ker h A K , h hom ( Tm L , A ) } , called the equational logic of  K , equal to that of
I [ SP ] K [ = { A A L ( A 2 ( { ker h h hom ( A , B ) , B K } ) ) = ϵ A } ] ,
satisfying any equational L-rule iff this is satisfied in K in the usual model-theoretic sense, as well as being finitary, whenever P U K I K (in view of the Compactness Theorem; cf. [7]) {in particular, both K and all its members are finite; cf. [3]}, but, otherwise, not necessarily being so,2 in which case L-algebras defining extensions of an equational logic C are called its models, their class being denoted by Mod ( C ) , and so the mappings C Mod ( C ) and P Cn P form a Galois retraction of the poset of pre-varieties (in the sense of [15]; viz., classes closed under I , S and P , ISP K being the least one including K and said to be generated by  K ) of L-algebras onto the one of the equational logics of classes of L-algebras. Clearly, the latter poset is closed under axiomatic extensions, the reservation “axiomatic” appearing redundant, in view of the following observation:
Remark 2.  
Given any class K of L-algebras and any θ ( img Cn K ) , there are some set I, some A ¯ K I and some h ¯ ( i I hom ( Tm L , A i ) ) such that θ = ( i I ( ker h i ) ) , in which case h : Fm L ( i I A i ) , φ h i ( φ ) i I is a [surjective] homomorphism from Tm L [on]to [ A θ ] ( ( i I A i ) [ ( img h ) ] ) [ SP K ] such that ( ker h ) = θ , and so, by the right alternative of (8), every equational L-rule R , such that each one in Sb L [ { R } ] is true in A θ under h, is true in A θ , any extension C of Cn K being then the equational logic of { A θ θ ( img C ) } SP K . □

Sequential languages

Let n m , where m , n [ ] ω 2 , be an ( m + n ) -ary sequent relation symbol, P [ ] { n m m , n ( ω 2 [ ] ) } the [ℓ-]sequent(ial) relation signature, L [ ] L , P [ ] the [ℓ-]sequent(ial) L-language and Seq L [ ] Fm L [ ] the set of L-sequents [of rank ℓ], any one n m ( φ ¯ ) being written in the standard form ( φ ¯ m ) ( ( ( + m ) n ) φ ¯ ) . Then, L [ ] -rules/-axioms/-calculi/-logics are called [ℓ-]sequent(ial) L-rules/-axioms/-calculi/-logics.

3. Preliminaries

3.1. Disjunctive sentential logics

Fix any Δ [ ω ] ( Tm L 2 ) . Given any X , Y Fm L , set Δ ( X , Y ) ( { Δ ( ϕ , ψ ) ϕ X , ψ Y } . Then, an L-logic C is said to be weakly/〈strongly〉 [finitely] Δ-disjunctive, if, for all ( X { ϕ , ψ } ) Fm L , C ( X Δ ( ϕ , ψ ) ) / = ( C ( X { ϕ } ) C ( X { ψ } ) ) /“in which case:
C ( Δ ( ϕ , ψ ) ) = C ( Δ ( ψ , ϕ ) ) ,
C ( Δ ( ϕ , ϕ ) ) = C ( { ϕ } ) .
Likewise, it is said to be Δ-multiplicative, if, for all ( X { φ } ) Fm L , Δ ( C ( X ) , φ ) C ( Δ ( X , φ ) ) . Finally, an L-matrix A is said to be Δ-disjunctive, if, for all a , b A , ( ( { a , b } D A ) ) ( { δ A ( a , b ) δ Δ } D A ) .
Theorem 1.  
A (finitary) L-logic C is Δ-disjunctive if(f) it is both weakly Δ-disjunctive and Δ-multiplicative, while both (11) and (12) hold {whereas:
C ( Δ ( φ , Δ ( ϕ , ψ ) ) ) = C ( Δ ( Δ ( φ , ϕ ) , ψ ) ) ,
for all φ , ϕ , ψ Fm L } if(f) C is defined by a class of [consistent] Δ-disjunctive L-matrices.
Proof. 
{The second “if” part is immediate.} Now, assume C is both weakly Δ -disjunctive and Δ -multiplicative, while both (11) and (12) hold. Consider any ( X { ϕ , ψ } ) Fm L and any φ ( C ( X { ϕ } ) C ( X { ψ } ) ) , in which case φ C ( Δ ( φ , φ ) ) C ( Δ ( C ( X { ψ } ) , φ ) C ( Δ ( X { ψ } , φ ) ) C ( X Δ ( ψ , φ ) ) = C ( X Δ ( φ , ψ ) ) C ( X Δ ( C ( { φ } ) , ψ ) ) C ( X C ( Δ ( X , ψ ) Δ ( ϕ , ψ ) ) ) = C ( X Δ ( ϕ , ψ ) ) , and so C, being weakly Δ -disjunctive, is Δ -disjunctive. (Finally, assume C is Δ -disjunctive. Then, by Remark 1, it, being finitary and structural, is defined by M ( { Tm L } × MI ( img C ) ) . Consider any T MI ( img C ) ¬ Fm L and any ϕ , ψ Fm L such that Δ ( ϕ , ψ ) T , in which case T = C ( T ) = C ( T Δ ( ϕ , ψ ) ) = ( C ( T { ϕ } ) C ( T { ψ } ) ) , and so either T = C ( T { ϕ } ) ϕ or T = C ( T { ψ } ) ψ , members of M being thus both consistent and Δ -disjunctive, by the weak Δ -disjunctivity of C.) □

3.1.1. Multiplicative sentential calculi

Given any R = Γ , ϕ Ru L and ψ Fm L , put Δ ( R , ψ ) { Δ ( Γ , ψ ) , φ φ Δ ( ϕ , ψ ) } , elements of Δ ( σ + 1 ( R ) , x 0 ) being called Δ-multiplications of R . Then, an L-calculus C is said to be Δ-multiplicative, if each multiplication of every rule of it is derivable in it, in which case, by induction on the length of C -derivations, Cn C is Δ -multiplicative, and so, by the structurality of L-logics and Theorem 1, we get:
Corollary 1.  
A [finitary] L-logic C is Δ-disjunctive if[f] it is both weakly Δ-disjunctive and axiomatized by a Δ-multiplicative L-calculus, while both (11) and (12) (as well as (13)) hold.

3.2. Extensions versus interpretations

Here, we entirely follow the conventions adopted in Chapter 2 but allowing not necessarily finitary logics as well as finitary translations (viz., those with finite values). Fix any propositional language L, first-order ones F [ ] = L , P [ ] , translations τ | ρ from P | P to P | P over L and an F [ ] -logic C [ ] . Then, τ is said to be compatible with C , if the condition (ii) of Definition 2.1 of [11] holds, that is (in view of the structurality of C ), C ( σ [ τ [ Γ ] ] ) = C ( τ [ σ [ Γ ] ] ) , for all σ Sb L and all [one-element] Γ Fm F (cf. Proposition 2.2 therein), i.e., for all σ Sb L and all Θ ( img C ) , σ 1 [ τ 1 [ Θ ] ] = τ 1 [ σ 1 [ Θ ] ] , in which case τ is compatible with any extension of C . In that case, τ is called an interpretation of C in C , if the condition (i) of Definition 2.1 of [11] holds too, that is, ( img C ) = τ 1 [ img C ] { τ 1 [ Θ ] Θ ( img C ) } (cf. Proposition 2.4 therein). We start from presenting the following almost immediate observation:
Lemma 1.  
Let C ( C ) be an F -logic (and C [ C ] an F-logic as well as C an F-calculus). Suppose τ is compatible with C (resp., with C [in particular, τ is an interpretation of C in C {more specifically, C and C are equivalent with 〈respect to〉τ and ρ}]). Then, τ 1 [ img C ] is a closure system over Fm F closed under inverse substitutions, in which case τ is an interpretation of the F-logic τ 1 ( C ) dual to τ 1 [ img C ] in C ([while C τ 1 ( C ) {whereas C = ρ 1 ( τ 1 ( C ) ) , and so τ 1 ( C ) and C are equivalent with 〈respect to〉τ and ρ}]). (Conversely, τ C [ img C ] { Θ ( img C ) τ 1 [ Θ ] ( img C ) } is a closure system over Fm F closed under inverse substitutions, in which case the F -logic τ C ( C ) dual to τ C [ img C ] is an extension of C , while τ C [ Cn C C ] = Cn τ [ C ] τ C ( C ) [and τ 1 ( τ C ( C ) ) = C , τ being an interpretation of C in τ C ( C ) {whereas τ C ( C ) = ρ 1 ( C ) , C and τ C ( C ) being equivalent with 〈respect to〉τ and ρ}]).
This, first, immediately yields the following infinitary extension of [11]:
Theorem 2.  
Suppose C and C are equivalent with (respect to) τ and ρ. Then, ρ 1 | τ C and τ 1 ρ C form inverse to one another isomorphisms between the complete lattices of [axiomatic] extensions of C and C , corresponding ones being equivalent with (respect to) τ and ρ.
And what is more, as an equally immediate consequence of Lemma 1, we have the following important result, being formally beyond the scopes of [11] but implicitly contained, though not explicitly presented, therein:
Theorem 3.  
Suppose τ is an interpretation of C in C . Then, τ C and τ 1 form a dual Galois retraction of the poset of extensions of C onto that of C, τ being an interpretation of any extension C of C (relatively axiomatized by an F-calculus C ) in the extension τ C ( C ) of C (relatively axiomatized by τ [ C ] ).
This, in its turn, by Remark 2, yields a more canonical insight into the main universal result of [13] in the spirit of the outstanding work [11] plagiarized (like [13]) more and more by such crooks as Font, Pigozzi, et al.:
Corollary 2 (cf. [13]) Let ∇ be a translation from { D } to { } over L, C an L-logic, K a class of L-algebras, P ISP K and C Cn K = Cn P . Suppose ∇ is an interpretation of C in C , i.e., C is defined by K { A , { a A A ( D ) [ x 0 / a ] } A K } , viz., by P . Then, the mappings C ( P Mod ( C ( C ) ) ) and S Cn S form a Galois retraction of the poset of sub-pre-varieties of P onto the one of extensions of C such that, for any L-calculus C , ( P Mod ( C ( Cn C C ) ) ) = ( P Mod ( [ C ] ) ) , while, for any C P , Cn ( ISP C ) = Cn C .

4. Main issues

Here, we deal with the propositional languages L + [ , 01 ] ( ) { , [ , , ] ( , ¬ ) } , where ∧ and ∨ are binary [while and are nullary] (whereas ¬ is unary) with [bounded] lattices {cf. [1]} viewed as L + [ , 01 ] -algebras, ϕ ψ standing for ϕ ( ϕ ψ ) . Then, a [bounded] (De)/ Morgan/Kleene lattice [traditionally called a (De)/ Morgan/Kleene algebra; cf., e.g., [1] is any L + [ , 01 ] -algebra with [bounded] distributive lattice L + [ , 01 ] -reduct, satisfying:
¬ ¬ x 0 x 0 ,
¬ ( x 0 x 1 ) ( ¬ x 0 ¬ x 1 ) ,
( x 0 ¬ x 0 ) ( x 0 / 1 ¬ x 0 / 1 ) ,
their variety being denoted by [ B ] ( M / K ) L . Let L n [ , 01 ] be the chain [bounded] lattice over n ( ω 2 ) , while K n [ , 01 ] the [bounded] Kleene lattice with [bounded] lattice reduct L n [ , 01 ] and ¬ K n [ , 01 ] { i , n 1 i i n } , whereas M 4 [ , 01 ] the [bounded] Morgan lattice with [bounded] lattice reduct L 2 [ , 01 ] 2 and ¬ M n [ , 01 ] : 2 2 2 2 , j , k 1 k , 1 j , the following standard notations of elements of 2 2 being used in this connection ( f | t ) 0 | 1 , 0 | 1 and ( n b ) 0 1 , 1 0 , as well as ( F D E / ( L P | K 3 ) / P C ) [ 01 ] the logic of ( M / K / K ) ( 4 / 3 / 2 ) [ , 01 ] / | / ( M / K / K ) ( 4 / 3 / 2 ) [ , 01 ] , { b / ( 1 | 2 ) / 1 , t / 2 / 1 } , being [the bounded (version of the)] “{relevance} first-degree entailment”/(“logic of paradox”|“Kleene three-valued logic”)/ “classical logic” [2]/ ([9]|[5])/[8], in which case the truth predicate of K 3 / 2 [ , 01 ] [ | ] / is equationally definable by the translation [ | ] { D , { ( ¬ x 0 [ | ] ) x 0 } } from { D } to { } over L + [ , 01 ] in the sense that:
K 3 / 2 [ , 01 ] [ | ] / x 0 ( D ( x 0 ) D [ | ] ) ,
and so the universal elaboration of [13] is equally applicable to the bounded versions of both the logic of paradox and Kleene three-valued logic. Then, for any L + [ , 01 ] -algebras A , B and any L + [ , 01 ] -rule R :
hom ( I { , ) S } ( A , B ) hom ( I { , ) S } ( S ) ( A [ | ] , B [ | ] ) ,
( A × B ) [ | ] = ( A [ | ] × B [ | ] ) ,
( A Mod ( [ ] ( R ) ) ) ( A [ | ] Mod ( R ) ) ,
so, for any K A L + [ , 01 ] :
Cn K [ | ] = Cn ( ISP K ) [ | ] .

4.1. An axiomatization of the bounded version of FDE

Let C H [ , 01 ] be the L + [ , 01 ] -calculus, constituted the L + -rules given by [10]:
( R 1 ) x 0 x 1 x 0 ( R 2 ) x 0 x 1 x 1 x 0 ( R 3 ) x 0 x 1 x 0 x 1 ( R 4 ) x 0 x 0 x 1 ( R 5 ) x 0 x 1 x 1 x 0 ( R 6 ) x 0 ( x 1 x 2 ) ( x 0 x 1 ) x 2 ( R 7 ) x 0 ( x 1 x 2 ) ( x 0 x 1 ) ( x 0 x 2 ) ( R 8 ) ( x 0 x 1 ) ( x 0 x 2 ) x 0 ( x 1 x 2 ) ( R 9 ) x 0 x 0 x 0 ( R 10 ) x 0 x 2 ¬ ¬ x 0 x 2 ( R 11 ) ¬ ¬ x 0 x 2 x 0 x 2 ( R 12 ) ( ¬ x 0 ¬ x 1 ) x 2 ¬ ( x 0 x 1 ) x 2 ( R 13 ) ¬ ( x 0 x 1 ) x 2 ( ¬ x 0 ¬ x 1 ) x 2 ( R 14 ) ( ¬ x 0 ¬ x 1 ) x 2 ¬ ( x 0 x 1 ) x 2 ( R 15 ) ¬ ( x 0 x 1 ) x 2 ( ¬ x 0 ¬ x 1 ) x 2
[and the following additional L + , 01 -rules and -axioms:
( R 16 ) x 0 x 0 ( R 17 ) ¬ x 0 x 0 ( A 1 ) ( A 2 ) ¬ ] .
Let EM ( x 0 ¬ x 0 ) be the Excluded Middle axiom, RS ( { x 0 x 1 , ¬ x 0 x 1 } x 1 ) the Resolution rule, C H R ¯ [ , 01 ] ( C H [ , 01 ] ( img R ¯ ) ) , where R ¯ { EM , RS } * , and M 4 c ¯ [ , 01 ] ( M 4 [ , 01 ] ( 2 2 ( img c ¯ ) ) ) , where c ¯ ( 2 2 ϵ 2 ) * .
Lemma 2.  
C ( EM ) { RS } H [ , 01 ] is ∨-multiplicative.
Proof. 
According to [10], F D E is axiomatized by C H . Then, since its defining matrix M 4 is ∨-disjunctive, by Theorem 1, it is ∨-multiplicative, while (13) holds for it, in which case both the rule R ¯ 6 inverse to R 6 and the ∨-multiplication of any rule of C H , being satisfied in F D E , are derivable in C H , and so in C ( EM ) { RS } H [ , 01 ] . Moreover, by R 4 , the ∨-multiplication of any axiom in [ { A 1 , A 2 } ] ( { EM } ) is derivable in C ( EM ) { RS } H [ , 01 ] . [Finally, due to the following demonstration:
  • ( ( | ¬ ) x 1 ) x 0 — Hypothesis;
  • ( | ¬ ) ( x 1 x 0 ) R ¯ 6 [ x 0 / ( | ¬ ) , x 2 / x 0 ] : ( 1 ) ;
  • x 1 x 0 R 16 | 17 [ x 0 / ( x 1 x 0 ) ] : ( 2 ) ;
the ∨-multiplication of R 16 | 17 , being derivable in { R 16 | 17 , R ¯ 6 } , is so in C ( EM ) { RS } H , 01 .] {Likewise, due to the following one:
  • ( x 1 x 2 ) x 0 — Hypothesis;
  • ( ¬ x 1 x 2 ) x 0 — Hypothesis;
  • x 1 ( x 2 x 0 ) R ¯ 6 [ x 0 / x 1 , x 1 / x 2 , x 2 / x 0 ] : ( 1 ) ;
  • ¬ x 1 ( x 2 x 0 ) R ¯ 6 [ x 0 / ¬ x 1 , x 1 / x 2 , x 2 / x 0 ] : ( 2 ) ;
  • x 2 x 0 RS [ x 0 / x 1 , x 1 / ( x 2 x 0 ) ] : ( 3 ) , ( 4 ) ;
the ∨-multiplication of RS , being derivable in { RS , R ¯ 6 } , is so in C ( EM ) RS H [ , 01 ] .} □
An L + [ , 01 ] -matrix A is said to be (∧-)conjunctive, if A , A D A is ∧-disjunctive.
Theorem 4.  
Cn C ( EM ) { RS } H [ , 01 ] = Cn M 4 ( n ) { b } [ , 01 ] .
Proof. 
Clearly, since M 4 [ , 01 ] [ B ] ML , M 4 ( n ) { b } [ , 01 ] , being both conjunctive and ∨-disjunctive, is a model of C ( EM ) { RS } H [ , 01 ] , i.e., C Cn C ( EM ) { RS } H [ , 01 ] Cn M 4 ( n ) { b } [ , 01 ] . Conversely, by Theorem 1, Corollary 1, Lemma 2 and the inclusion { R i i { 4 , 5 , 9 } } C ( EM ) { RS } H [ , 01 ] , C, being both finitary and ∨-disjunctive, is defined by a class M of consistent ∨-disjunctive L + [ , 01 ] -matrices. Consider any A M Mod ( C ( EM ) { RS } H [ , 01 ] ) and take any a ( A D A ) , in which case, by the truth of R 1 , R 2 and R 3 in A , this is conjunctive [while, by that of A 1 , A D A , whereas by that of R 16 under [ x 0 / a ] , A D A ]. Then, [by the truth of A 2 in A , A E ( A ( ¬ A ) 1 [ D A ] ) , while, by that of R 17 under [ x 0 / a ] , A E , whereas] by that of R 12 , R 13 , R 14 and R 15 under assignments containing x 2 , a , A , E is both conjunctive and ∨-disjunctive, for A is so. Finally, consider any b A , in which case, by the truth of R 10 and R 11 in A under [ x 0 / b , x 2 / a ] , ( b D A ) ( ¬ A ¬ A b D A ) (while, by that of EM in A under [ x 0 / b ] , ( { b , ¬ A b } D A ) ) {whereas, by that of RS in A under [ x 0 / b , x 1 / a ] , { b , ¬ A b } D A }, and so e χ A D A hom ( A L + [ , 01 ] , L 2 [ , 01 ] ) f χ A E , { c , e ( c ) , f ( c ) c A } being in hom S ( A , M 4 ( n ) { b } [ , 01 ] ) , as required, in view of (9). □
This, by (9) and the fact that ( ( + | π 0 ) M 4 ( ( n | b ) / ( n b ) ) ) is an isomorphism from M 4 ( ( n | b ) / ( n b ) ) [ , 01 ] onto K ( 3 / 2 ) [ , 01 ] | / ) , immediately yields:
Corollary 3. ( F D E / ( L P | K 3 ) / P C ) [ 01 ] is axiomatized by C / ( EM | RS ) / ( EM , RS ) H [ , 01 ] . In particular, K 3 [ 01 ] is the extension of F D E [ 01 ] , relatively axiomatized by RS , while ( L P P C ) [ 01 ] is the axiomatic extension of ( F D E K 3 ) [ 01 ] relatively axiomatized by EM .
This subsumes [10].

4.2. Extensions of the bounded logic of paradox and Kleene’s three-valued logic versus pre-varieties of Kleene algebras

Key observations enabling one to expand [13] onto the bounded case almost immediately are as follows:
Lemma 3.  
Let A and B be bounded lattices and h hom ( A L + , B L + ) . Suppose ( | ) B h [ A ] (in particular, h [ A ] = B ). Then, h ( ( | ) A ) = ( | ) B .
Proof. 
Take any ( a | b ) A such that h ( a | b ) = ( | ) B , in which case ( ( a | b ) ( | ) A ( | ) A ) = ( | ) A , so h ( ( | ) A ) = ( ( | ) B ( | ) B h ( ( | ) A ) ) = ( | ) B . □
Lemma 4.  
For any {2-element} [bounded] Morgan lattice A and any (distinct) a , b A , { 0 , ( ( a A ¬ A a ) A ( b A ¬ A b ) ) [ A A ] , 1 , ( ( a A ¬ A a ) A ( b A ¬ A b ) ) [ A A ] hom ( I { , S } ) ( K 2 [ , 01 ] , A ) .
Since K 3 has no non-one-element subalgebra not retaining bounds, by (10), Lemma 3 and [12], we, first, have the following well-known fact (cf., e.g., [1]):
Corollary 4.  
BKL = ISP ( P U ) K 3 , 01 .
Let N ( L ) P 01 be the extension of L P 01 relatively axiomatized by the Ex Contradictione Quodlibet rule NP ( { x 0 , ¬ x 0 } x 1 ) , viz., the least non-paraconsistent extension of L P [ 01 ] . Then, a [bounded] Kleene lattice is said to be non-paraconsis-tent, if it satisfies ( NP ) , i.e., satisfies [13]:
{ ¬ x 0 x 0 } ( [ x 0 / x 1 ] ) ,
in which it satisfies ( ) [ x 1 / ¬ x 1 ] , and so, by the right alternative of (16), satisfies [12]:
{ ¬ x 0 x 0 } ( x 0 x 1 ) ,
i.e., it is non-idempotent in the sense of [12]. Conversely, any [bounded] Kleene lattice, satisfying (23), satisfies ( ) [ x 1 / ¬ x 1 ] , in which case it is non-paraconsistent, and so non-paraconsistent [bounded] Kleene lattices are exactly non-idempotent ones, their quasi-variety being denoted by N [ B ] KL .
Let NK 6 [ ( + 2 ) , 01 ] ( ( ( K 3 [ , 01 ] × K 2 [ , 01 ] ) [ ( × K 3 , 01 ) ] ) [ ( ( ( ( 3 × 2 ) × { 1 } ) { 2 · i , i , 2 · i i 2 } ) ) ] ) and NK 6 , 01 ( K 3 , 01 × K 2 , 01 ) . Then, since the only non-one-element subalgebra of NK 6 not retaining bounds is that with two-element carrier { 1 } × 2 , by (10), Lemmas 3, 4 and [12]/[13], we immediately have:
Corollary 5.  
NBKL = ISP ( P U ) NK 6 , 01 .
Let M P [ 01 ] be the extension of ( N ) L P [ 01 ] relatively axiomatized by the Modus Ponens rule for material implication MP ( { x 0 , ¬ x 0 x 1 } x 1 ) (in view of the ∨-disjunctivity of K 3 [ , 01 ] and Theorem 1). Then, a [bounded] Kleene lattice is said to be regular/classical (cf. Definition 4.6/4.11 of [12]/[13]), if it satisfies ( MP ) , i.e., satisfies (10/14) of [12]/[13]:
( { ( x 0 ¬ x 1 ) ( ¬ x 0 x 1 ) } ) ( [ x 0 / x 1 ] ) ,
their quasi-variety being denoted by R [ B ] KL N [ B ] KL . Since the only non-one-element subalgebra of K 4 not retaining bounds is that with two-element carrier { 1 , 2 } , by (10), Lemmas 3, 4 and [12], we immediately get:
Corollary 6.  
R [ B ] KL = ISP ( P U ) K 4 [ , 01 ] .
From now on, we use (17), (18), (19), (20), (21) and Corollary 2 tacitly. Then, by Corollaries 4 and 5, we, first, have:
Theorem 5.(An arbitrary exrension C of) [ N ] L P 01 = Cn [ N ] K 3 [ + 3 ] , 01 is defined by [ N ] BKL ( Mod ( C ) ) .
Theorem 6. ( Thm ) ( M P [ 01 ] ) = ( Thm ) ( P C [ 01 ] ) ( = Thm ( L P [ 01 ] ) ) .
Proof. 
Then, by Theorem 5 and Corollary 6, M P [ 01 ] , being defined by R [ B ] KL , is defined by K 4 [ , 01 ] K 4 [ , 01 ] = K 4 [ , 01 ] , { 2 , 3 } , while χ 4 { 2 , 3 } hom S S ( K 4 [ , 01 ] , K 2 [ , 01 ] ) , whereas { i , χ 4 { 3 } ( i ) + χ 4 4 1 ( i ) } hom S ( K 4 [ , 01 ] , K 3 [ , 01 ] ) , (9) ending the proof.3
Theorem 7.  
Proper consistent extensions of L P 01 form the two-element chain N P 01 P C 01 .
Proof. 
First, K 3 , 01 ¬ NP [ x i / ( 1 i ) ] i 2 , while NK 6 , 01 ¬ MP [ x j / 1 j , 1 ] j 2 , whereas K 2 , 01 ¬ x 0 [ x 0 / 0 ] . Then, by Theorems 5 and 6, N P 01 and P C 01 are proper consistent extensions of L P 01 forming the chain involved. Finally, consider any consistent extension C of L P 01 , in which case, by Theorem 5, there is a non-one-element A BKL such that A Mod ( C ) , and so, by (9) and Lemma 4, C P C 01 . In particular, C = P C 01 , whenever P C 01 C . Otherwise, consider the following complementary cases:
  • N P 01 C ,
    in which case, by Theorem 5, there is some A ( NBKL RBKL ) such that A Mod ( C ) , and so B ( A L + ) ( NKL RKL ) . Then, by the case 4/3 of the proof of Theorem 4.8/4.11 of [12]/[13], there is an e hom I ( NK 6 , B ) . Consider the following complementary subcases:
    • e ( 0 , 0 ) = A ,
      in which case e ( 2 , 1 ) = A , and so e hom I ( NK 6 , 01 , A ) . Then, by (9), NK 6 , 01 = NK 6 , 01 Mod ( C ) .
    • e ( 0 , 0 ) A ,4
      in which case e ( 2 , 1 ) A , so ( ( ( π 0 ( N K 6 × { 1 } ) ) e ) { 0 , 0 , 0 , A , 2 , 1 , 2 , A } ) hom I ( NK 8 , 01 , A ) . Also, ( π 0 N K 8 , 01 ) hom S S ( NK 8 , 01 , NK 6 , 01 ) . Then, by (9), NK 6 , 01 Mod ( C ) .
    Thus, anyway, NK 6 , 01 Mod ( C ) , in which case, by Theorem 5, C N P 01 , and so C = N P 01 .
  • N P 01 C ,
    in which case, by Theorem 5, there is some A ( BKL NBKL ) such that A Mod ( C ) , and so there is some a A { a } such that ¬ A a = a . Then, { 0 , A , 1 , a , 2 , A } hom I ( K 3 , 01 , A ) , in which case, by (9), K 3 , 01 = K 3 , 01 Mod ( C ) , and so C = L P 01 . □
Theorem 8.  
P C 01 is the only proper consistent extension of K 3 01 .
Proof. 
Consider a consistent extension C of K 3 01 distinct from P C 01 , in which case, by Theorem 7, P C 01 C , and so, by Corollaries 3 and 4, there is some A BKL such that A ( Mod ( C ) Mod ( EM ) ) . Then, there is some a A such that b ( a A ¬ A a ) A . Consider the following complementary cases:
  • ¬ A b = b ,
    in which case { 0 , A , 1 , b , 2 , A } hom I ( K 3 , 01 , A ) , and so, by (9), K 3 , 01 Mod ( C ) .
  • ¬ A b b ,
    in which case { 0 , A , 1 , ¬ A b , 2 , b , 3 , A } hom I ( K 4 , 01 , A ) , and so, by (9), K 3 , 01 Mod ( C ) , for { i , χ 4 4 1 ( i ) + χ 4 4 3 ( i ) i 4 } hom S S ( K 4 , 01 , K 3 , 01 ) .
Thus, in any case, K 3 , 01 Mod ( C ) , i.e., C K 3 01 , C being equal to K 3 01 , as required, in view of Corollary 3, for K 3 , 01 ¬ EM [ x 0 / 1 ] . □
If, for any ( Tm L 1 ) 2 , x 0 ( D ( x 0 ) ( ) ) was true in K 3 , then it would be true in K 1 ( K 3 { 1 } ) , in which case, since K 1 x 0 ( ) , x 0 D ( x 0 ) would be true in K 1 , and so 1 K 1 would be in D K 1 = . Nevertheless, though the universal algebraic approach developed in [13] is thus not applicable to K 3 , Theorem 8 is still so as follows.
Lemma 5.  
Any extension C of K 3 with(out) theorems is (the theorem-less version of) the L + , D -fragment of an extension of K 3 01 .
Proof. 
Consider any T ( ( img C ) 1 ) , in which case there exists some H T hom ( Tm L + , K 3 ) such that T = ( Fm L + ( h H T h 1 [ { 2 } ] ) ) , and so g T : Fm L + 3 H T , φ f ( φ ) f H T is a [surjective] strict homomorphism from Tm L + , T [on]to [ A T ] ( ( K 3 ) H T [ ( img g T ) ] ) . Take any ϕ T , in which case A T g T ( ϕ ) = ( H T × { 2 } ) , and so A T g T ( ¬ ϕ ) = ( H T × { 0 } ) . Then, A T forms a subalgebra of D T K 3 , 01 H T , in which case, by (9), B T D T A T , D A T , being a submatrix of ( K 3 , 01 ) H T , is a model of K 3 01 , and so K 3 01 C Cn { B T T ( ( img C ) 1 ) } . Thus, by (9), C = Cn { Tm L + } × ( ( img C ) 1 ) ( + 0 ) = Cn { A T T ( ( img C ) 1 ) } ( + 0 ) = ( C L + , D ) ( + 0 ) . □
Let I C be the inconsistent L + -logic.
Corollary 7.  
Proper extensions of K 3 form the diamond lattice, isomorphic to L 2 2 under ι 1 , where ι : 2 2 ( Fm L + ) ( Fm L + ) , 0 | 1 , 1 [ 1 ] ) ( P | I ) C [ + 0 ] = Cn { [ x 1 ] ( EM | x 0 ) } L P | ( L P ) = Cn ( { K 2 } | ) [ { K 1 } ] is injective.
Proof. 
Clearly, no axiom is true in the {sub}matrix K 1 {of K 3 } with empty truth predicate, while K 3 2 ¬ ( x 1 ( EM x 0 ) [ x 0 / ( 1 0 ) , x 1 / ( 2 1 ) ] , (6), (7), (9), Corollary 3, Theorem 8 and Lemma 5 completing the argument. □

4.3. Cut-free versions of Gentzen calculus

Let L K ( R / R C ] ) ( / { + CFC } ) [ 01 ] be the ( ω 2 ( 1 [ 1 ] ) 2 ) -sequent L + [ , 01 ] -calculus constituted by the following strucural rules (except for Reflexivity/“〈both Reflexivity and〉 Cut {with non- ( 1 [ 1 ] ) -ary sequent predicate in conclusion}”):
R e f l e x i v i t y x 0 x 0 ( / { C o n t e x t F r e e } ) C u t { Λ , x 0 Ξ ; Λ Ξ , x 0 } Λ ( Ξ * ( x ¯ k σ + 1 ) ) L e f t R i g h t E n l a r g e m e n t Γ Δ Γ , x 0 Δ Γ Δ Γ Δ , x 0 C o n t r a c t i o n Γ , x 0 , x 0 Δ Γ , x 0 Δ Γ Δ , x 0 , x 0 Γ Δ , x 0 P e r m u t a t i o n Γ , x 0 , x 1 , Θ Δ Γ , x 1 , x 0 , Θ Δ Γ Δ , x 0 , x 1 , Θ Γ Δ , x 1 , x 0 , Θ
where Γ , Δ , Θ Var * Λ , Ξ ( ( / ( { Var + } ) ) ) and k ( ( 1 min ( 1 , ( dom Λ ) + ( dom Ξ ) ) ) [ · 0 ] ) , together with the following logical rules [and axioms]:
L e f t R i g h t [ ] ( ¬ ) Γ Δ , x 0 Γ , ¬ x 0 Δ Γ , x 0 Δ Γ Δ , ¬ x 0 ( ) Γ , x 0 , x 1 Δ Γ , x 0 x 1 Δ { Γ Δ , x 0 ; Γ Δ , x 1 } Γ Δ , x 0 x 1 ( ) { Γ , x 0 Δ ; Γ , x 1 Δ } Γ , x 0 x 1 Δ Γ Δ , x 0 , x 1 Γ Δ , x 0 x 1
where Γ , Δ Var * (as well as [both] the rules inverse to logical ones [and the following constant elimination rules:
L e f t R i g h t Γ , Δ Γ Δ Γ Δ , Γ Δ
where Γ , Δ Var * ]) its rules being derivable in L K [ 01 ] .
Let
τ [ 01 ] { n m , { + ( [ ] x ¯ m * ( x ¯ n σ + m ) [ , ] ) } m , n ( ω 2 ( 1 [ 1 ] ) 2 ) }
and ρ { D , { x 0 } } be parameter-less translations from P ω 2 ( 1 [ 1 ] ) 2 to { D } and vice versa over L + [ , 01 ] in the sense of the fundamental work [11] we follow here tacitly.
Lemma 6.  
Cn L K RC [ 01 ] and F D E [ 01 ] are equivalent with (respect to) τ [ 01 ] and ρ.
Proof. 
First, for any ( Γ Ψ ) L K RC [ 01 ] and any Φ ¯ Γ | Γ | with range-image Γ , ( + ( [ ] Φ ¯ τ [ 01 ] [ , ] ) ) τ [ 01 ] ( Ψ ) is true in [ B ] ML M 4 [ , 01 ] , so τ [ 01 ] [ Γ ] τ [ 01 ] ( Ψ ) is true in M 4 [ , 01 ] , for D M 4 [ , 01 ] [ M 4 , 01 ] is a filter of M 4 [ , 01 ] L + . Likewise, x 0 ρ ( τ [ 01 ] ( D ) ) is true in [ B ] ML M 4 [ , 01 ] , so both x 0 τ [ 01 ] ( ρ ( D ) ) and τ [ 01 ] ( ρ ( D ) ) x 0 are true in M 4 [ , 01 ] . Conversely, for any ( Γ φ ) C H [ , 01 ] , ρ [ Γ ] ρ ( φ ) is derivable in L K RC [ 01 ] . Finally, for all m , n ( ω 2 ( 1 [ 1 ] ) 2 ) , both Υ ρ ( τ [ 01 ] ( n m ) ) and ρ ( τ [ 01 ] ( n m ) ) Υ , where Υ ( x ¯ m ( x ¯ n σ + m ) ) , are derivable in L K RC [ 01 ] . Then, Theorems 2.24 of [11] and 4 complete the argument. □
Theorem 9.  
Cn L K [ 01 ] ( C / R ) and ( L P / K 3 ) [ 01 ] are equivalent with (respect to) τ [ 01 ] and ρ.
Proof. 
Clearly, τ [ 01 ] ( Reflexivity / Cut ) is true in K 3 [ , 01 ] / , while ρ ( EM / RS ) is derivable in L K [ 01 ] ( C / R ) , Corollaries 2.27 of [11], 3 and Lemma 6 ending the proof. □
Corollary 8 (cf. [13] for the non-[]-optional case) Proper consistent extensions of Cn L K [ 01 ] C form the two-element chain Cn L K C + CFC [ , 01 ] Cn L K [ 01 ] , the lesser/greater being equivalent to ( N P / P C ) [ 01 ] with (respect to) τ [ 01 ] and ρ.
Proof. 
Clearly, τ [ 01 ] [ { x 0 ; x 0 } ] τ [ 01 ] ( ( x ¯ 1 [ · 0 ] σ + 1 ) ) is true in NK 6 [ , 01 ] . Conversely, ρ [ { x 0 , ¬ x 0 } ] ρ ( x 1 ) is derivable in L K C + CFC [ , 01 ] . Likewise, for any instance Γ Φ of Cut τ [ 01 ] [ Γ ] τ [ 01 ] ( Φ ) is true in K 2 [ , 01 ] . Finally, ρ [ { x 0 , ¬ x 0 x 1 } ] ρ ( x 1 ) is derivable in L K [ 01 ] . Then, Theorems 2, 5, 6, 7,13], 9 and [11] complete the argument. □
Corollary 9.  
Cn L K 01 is the only proper consistent extension of Cn L K 01 C .
Proof. 
Clearly, τ 01 ( Reflexivity ) is true in K 2 , 01 . Conversely, ρ ( EM ) is derivable in L K 01 . Then, Theorems 2, 8, 9 and [11] complete the argument. □
Likewise, by Theorems 2 and 9 as well as Corollaries [11] and 7, we eventually get:
Corollary 10.  
Proper extensions of Cn L K R form the diamond lattice, isomorphic to the one of those of K 3 under κ { Cn L K R { ( x 1 ) ( x 0 ¬ x 0 ) } , P C + 0 , Cn L K R { ( x 1 ) ( x 0 ) } , I C + 0 , Cn L K R { x 0 } , I C , Cn L K , P C } , any C ( dom κ ) and κ ( C ) being equivalent with [respect to] τ and ρ.

References

  1. R. Balbes and P. Dwinger, Distributive Lattices, University of Missouri Press, Columbia (Missouri), 1974.
  2. N. D. Belnap, Jr, A useful four-valued logic, Modern uses of multiple-valued logic (J. M. Dunn and G. Epstein, eds.), D. Reidel Publishing Company, Dordrecht, 1977, pp. 8–37.
  3. T. Frayne, A.C. Morel, and D.S. Scott, Reduced direct products, Fundamenta Mathematicae 51 (1962), 195–228.
  4. G. Gentzen, Untersuchungen über das logische Schliessen, Mathematische Zeitschrift 39 (1934), 176–210, 405–431.
  5. S. C. Kleene, Introduction to metamathematics, D. Van Nostrand Company, New York, 1952.
  6. J. oś and R. Suszko, Remarks on sentential logics, Indagationes Mathematicae 20 (1958), 177–183.
  7. A. I. Mal’cev, Algebraic systems, Springer Verlag, New York, 1965.
  8. E. Mendelson, Introduction to mathematical logic, 2nd ed., D. Van Nostrand Company, New York, 1979.
  9. G. Priest, The logic of paradox, Journal of Philosophical Logic 8 (1979), 219–241.
  10. A. P. Pynko, Characterizing Belnap’s logic via De Morgan’s laws, Mathematical Logic Quarterly 41 (1995), no. 4, 442–454.
  11. ——, Definitional equivalence and algebraizability of generalized logical systems, Annals of Pure and Applied Logic 98 (1999), 1–68.
  12. ——, Implicational classes of De Morgan lattices, Discrete mathematics 205 (1999), 171–181.
  13. ——, Subprevarieties versus extensions. Application to the logic of paradox, Journal of Symbolic Logic 65 (2000), no. 2, 756–766.
  14. ——, Gentzen’s cut-free calculus versus the logic of paradox, Bulletin of the Section of Logic 39 (2010), no. 1/2, 35–42.
  15. L. A. Skornyakov (ed.), General algebra, vol. 2, Nauka, Moscow, 1991, In Russian.
1
This is mainly why we have extended here the finitary framework of [11].
2
This is one more reason of our going beyond the finitary framework of [11].
3
Though [13] is expandable onto the bounded case, we have presented here more immediate and transparent model-theoretic proofs of both it and the axiomatizability of the [bounded] classical logic relatively to the [bounded] logic of paradox by Modus Ponens for material implication.
4
It is this subcase that justifies the reservation “almost” in the first sentence of this subsection.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated