Here, we deal with the propositional languages
, where ∧ and ∨ are binary [while
⊥ and
⊤ are nullary] (whereas ¬ is unary) with [bounded] lattices {cf. [
1]} viewed as
-algebras,
standing for
. Then, a
[bounded] (De)/ Morgan/Kleene lattice [traditionally called a
(De)/ Morgan/Kleene algebra; cf., e.g., [
1] is any
-algebra with [bounded] distributive lattice
-reduct, satisfying:
their variety being denoted by
. Let
be the chain [bounded] lattice over
, while
the [bounded] Kleene lattice with [bounded] lattice reduct
and
, whereas
the [bounded] Morgan lattice with [bounded] lattice reduct
and
, the following standard notations of elements of
being used in this connection
and
, as well as
the logic of
, 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
is equationally definable by the translation
from
to
over
in the sense that:
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
-algebras
and any
-rule
:
so, for any
:
4.1. An axiomatization of the bounded version of FDE
Let
be the
-calculus, constituted the
-rules given by [
10]:
[and the following additional
-rules and -axioms:
Let be the Excluded Middle axiom, the Resolution rule, , where , and , where .
Lemma 2. is ∨-multiplicative.
Proof. According to [
10],
is axiomatized by
. Then, since its defining matrix
is ∨-disjunctive, by Theorem 1, it is ∨-multiplicative, while (
13) holds for it, in which case both the rule
inverse to
and the ∨-multiplication of any rule of
, being satisfied in
, are derivable in
, and so in
. Moreover, by
, the ∨-multiplication of any axiom in
is derivable in
. [Finally, due to the following demonstration:
— Hypothesis;
— ;
— ;
the ∨-multiplication of , being derivable in , is so in .] {Likewise, due to the following one:
— Hypothesis;
— Hypothesis;
— ;
— ;
— ;
the ∨-multiplication of , being derivable in , is so in .} □
An -matrix is said to be (∧-)conjunctive, if is ∧-disjunctive.
Theorem 4. .
Proof. Clearly, since
,
, being both conjunctive and ∨-disjunctive, is a model of
, i.e.,
. Conversely, by Theorem 1, Corollary 1, Lemma 2 and the inclusion
,
C, being both finitary and ∨-disjunctive, is defined by a class
of consistent ∨-disjunctive
-matrices. Consider any
and take any
, in which case, by the truth of
,
and
in
, this is conjunctive [while, by that of
,
, whereas by that of
under
,
]. Then, [by the truth of
in
,
, while, by that of
under
,
, whereas] by that of
,
,
and
under assignments containing
,
is both conjunctive and ∨-disjunctive, for
is so. Finally, consider any
, in which case, by the truth of
and
in
under
,
(while, by that of
in
under
,
) {whereas, by that of
in
under
,
}, and so
,
being in
, as required, in view of (
9). □
This, by (
9) and the fact that
is an isomorphism from
onto
, immediately yields:
Corollary 3. is axiomatized by . In particular, is the extension of , relatively axiomatized by , while is the axiomatic extension of relatively axiomatized by .
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 and be bounded lattices and . Suppose (in particular, ). Then, .
Proof. Take any such that , in which case , so . □
Lemma 4. For any {2-element} [bounded] Morgan lattice and any (distinct) , .
Since
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. .
Let
be the extension of
relatively axiomatized by the
Ex Contradictione Quodlibet rule
, viz., the least non-paraconsistent extension of
. Then, a [bounded] Kleene lattice is said to be
non-paraconsis-tent, if it satisfies
, i.e., satisfies [
13]:
in which it satisfies
, and so, by the right alternative of (16), satisfies [
12]:
i.e., it is
non-idempotent in the sense of [
12]. Conversely, any [bounded] Kleene lattice, satisfying (
23), satisfies
, 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
.
Let
and
. Then, since the only non-one-element subalgebra of
not retaining bounds is that with two-element carrier
, by (
10), Lemmas 3, 4 and [
12]/[
13], we immediately have:
Corollary 5. .
Let
be the extension of
relatively axiomatized by the
Modus Ponens rule for material implication
(in view of the ∨-disjunctivity of
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
, i.e., satisfies (10/14) of [
12]/[
13]:
their quasi-variety being denoted by
. Since the only non-one-element subalgebra of
not retaining bounds is that with two-element carrier
, by (
10), Lemmas 3, 4 and [
12], we immediately get:
Corollary 6. .
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) is defined by .
Theorem 6..
Proof. Then, by Theorem 5 and Corollary 6,
, being defined by
, is defined by
, while
, whereas
, (
9) ending the proof.
3 □
Theorem 7. Proper consistent extensions of form the two-element chain .
Proof. First,
, while
, whereas
. Then, by Theorems 5 and 6,
and
are proper consistent extensions of
forming the chain involved. Finally, consider any consistent extension
C of
, in which case, by Theorem 5, there is a non-one-element
such that
, and so, by (
9) and Lemma 4,
. In particular,
, whenever
. Otherwise, consider the following complementary cases:
-
,
in which case, by Theorem 5, there is some
such that
, and so
. Then, by the case 4/3 of the proof of Theorem 4.8/4.11 of [
12]/[
13], there is an
. Consider the following complementary subcases:
-
,
in which case
, and so
. Then, by (
9),
.
-
in which case
, so
. Also,
. Then, by (
9),
.
Thus, anyway, , in which case, by Theorem 5, , and so .
-
,
in which case, by Theorem 5, there is some
such that
, and so there is some
such that
. Then,
, in which case, by (
9),
, and so
. □
□
Theorem 8. is the only proper consistent extension of .
Proof. Consider a consistent extension C of distinct from , in which case, by Theorem 7, , and so, by Corollaries 3 and 4, there is some such that . Then, there is some such that . Consider the following complementary cases:
-
,
in which case
, and so, by (
9),
.
-
,
in which case
, and so, by (
9),
, for
.
Thus, in any case, , i.e., , C being equal to , as required, in view of Corollary 3, for . □
If, for any
,
was true in
, then it would be true in
, in which case, since
,
would be true in
, and so
would be in
. Nevertheless, though the universal algebraic approach developed in [
13] is thus not applicable to
, Theorem 8 is still so as follows.
Lemma 5. Any extension C of with(out) theorems is (the theorem-less version of) the -fragment of an extension of .
Proof. Consider any
, in which case there exists some
such that
, and so
is a [surjective] strict homomorphism from
[on]to
. Take any
, in which case
, and so
. Then,
forms a subalgebra of
, in which case, by (
9),
, being a submatrix of
, is a model of
, and so
. Thus, by (
9),
. □
Let be the inconsistent -logic.
Corollary 7. Proper extensions of form the diamond lattice, isomorphic to under , where is injective.
Proof. Clearly, no axiom is true in the {sub}matrix
{of
} with empty truth predicate, while
, (
6), (
7), (
9), Corollary 3, Theorem 8 and Lemma 5 completing the argument. □
4.3. Cut-free versions of Gentzen calculus
Let
be the
-sequent
-calculus constituted by the following
strucural rules (except for Reflexivity/“〈both Reflexivity and〉 Cut {with non-
-ary sequent predicate in conclusion}”):
where
and
, together with the following
logical rules [and axioms]:
where
(as well as [both] the rules inverse to logical ones [and the following
constant elimination rules:
where
]) its rules being derivable in
.
Let
and
be parameter-less translations from
to
and
vice versa over
in the sense of the fundamental work [
11] we follow here tacitly.
Lemma 6. and are equivalent with (respect to) and ρ.
Proof. First, for any
and any
with range-image
,
is true in
, so
is true in
, for
is a filter of
. Likewise,
is true in
, so both
and
are true in
. Conversely, for any
,
is derivable in
. Finally, for all
, both
and
, where
, are derivable in
. Then, Theorems 2.24 of [
11] and 4 complete the argument. □
Theorem 9. and are equivalent with (respect to) and ρ.
Proof. Clearly,
is true in
, while
is derivable in
, 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 form the two-element chain , the lesser/greater being equivalent to with (respect to) and ρ.
Proof. Clearly,
is true in
. Conversely,
is derivable in
. Likewise, for any instance
of Cut
is true in
. Finally,
is derivable in
. Then, Theorems 2, 5, 6, 7,
13], 9 and [
11] complete the argument. □
Corollary 9. is the only proper consistent extension of .
Proof. Clearly,
is true in
. Conversely,
is derivable in
. 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 form the diamond lattice, isomorphic to the one of those of under , any and being equivalent with [respect to] τ and ρ.