Preprint
Article

This version is not peer-reviewed.

Four-Valued Logics with Infinitely Many Extensions

Submitted:

16 September 2025

Posted:

17 September 2025

You are already at the latest version

Abstract
Here, we we prove that there is a strictly increasing countable chain of finitary relatively finitely-axiomatizable extensions of ({the} truth-singular {version/extension of})[{the} bounded {expansion of}] first-degree entailments - (TS)[B]FDE, for short - /``relatively axiomatized by the Modus Ponens rule for material implication'', in which case the chain does not contain its join,and so this, being a finitary extension of (TS)[B]FDE, is not {relatively} finitely-axiomatizable. ([As a consequence, applying one of our previous works, we immediately get a strictly decreasing chain of finitely-axiomatizable quasi-varieties of bounded De Morgan lattices including the variety of bounded Kleene lattices with non-finitely-axiomatizable intersection.])
Keywords: 
;  ;  

1. Introduction

Appearance of any mathematical object inevitably raises the issue of its connection with other similar ones. Perhaps, the most important relation within General Logic, foundations of which go back to [1,2,3,4,5], is the extension/sublogic one between logics reflecting relative deductive strength of different logical systems. On the other hand, thus far, one of most representable non-classical many-valued logics — the four-valued one of first-degree entailments in Relevance logic [6,7,8] (cf. [9,10,11]) — has not been studied with regard to the issue involved, though extension lattices of certain four-valued expansions [but the bounded one] of it introduced in [10] have already been found — namely, due to [10,12,13]/“{[10,14]|}[11]”, it has been known that extensions of the {bounded} implicative/bi-lattice expansion of FDE form a ( ( 12 { + 18 } ) / 2 ) -element distributive lattice. The principal goal of this work is to fill the above gap[s] up.
The rest of the work is as follows. To avoid extensive specifications of conventional well-known issues underlying the present work, we entirely follow the conventions adopted in [11] tacitly except for making explicit references to specific advanced points. Then, the main results described above are presented in Section 2. Finally, Section 3 is devoted to both a concise summary of principal contributions of the paper and a thorough comparison of them with other related works on non-classical many-valued logics as well as a brief outline of further related work.

2. Main Issues

Given any (non-one-element) A [ B ] DML , ( / £ ) A { a A a = / A A a } / = { b A A b b A } [ ( | ¬ ) ( ( | ) ) A ] does ([not])/ include ( [ { A } / ] ) { c A c A d £ A } .
Let C ( ) be the logic of DB 4 [ , 01 ] ( ) ( DM 4 [ , 01 ] , { t } ) .
Given any n ( ω 1 ) and Σ + , 1 { + n } ( x i ) i ( 1 { + n } ) ( { n ( x j ) j n } x 0 { + n } ) Fm Σ + 1 { + n } . Then, any member of S ( P ( DM 4 [ , 01 ] ( ) ) ) is a model of R n ( { n ( x k x k ) k n } x n ) iff it is a model of R n + 1 [ x n + l / x n · l ] l 2 if it is a model of R n + 1 , in which case, by (Theorem 2.8 [11]), the extension C n ( ) of C ( ) relatively axiomatized by R n is a sub-logic of C n + 1 ( ) , and so C m ( ) m ( ω 1 ) is a denumerable increasing chain of finitary relatively finitely-axiomatizable extensions of C ( ) with join, being its finitary extension C ω ( ) relatively axiomatized by C ω { R ( ω 1 ) } .
Lemma 2.1 
Let i n ( ω 1 ) , a ¯ { j , b } ( ( n { j } ) × { n } ) j n , n × { n } and A DM 4 [ , 01 ] : n the subalgebra of B DM 4 [ , 01 ] n generated by I n ( img a ¯ ) B . Then, S n , i ( £ A π i 1 [ { b } ] ) = { a i } .
Proof. 
Clearly, I n ( A B ) = A £ A £ B = ( 2 2 { t } ) n . In particular, a i S n , i . Conversely, given any X B , let ( C | D ) ( X ) ( m ( ω 1 ) ( ( | ) m B [ X m ] ) ) X , in which case A = ( D ( C ( I n ) ) [ { B , B } ] ) , as I n B , while ( C ( I n ) I n ) { f , n } n , since, for all distinct ı , j n , ( a ı B a j ) { f , n } n , whereas { f , n } is an ideal of D 2 2 , and so any b S n , i , being then equal to l B ( c ¯ ) , for some l ( ω 1 ) and c ¯ C ( I n ) l such that a i ( img c ¯ ) , because, otherwise, π i ( b ) = b would be in { f , n } ¬ b , is equal to a i , for { n , b } n a i B b { f , b , n } n , as required. □
Corollary 2.2 
Let n ( ω ( 2 { 1 ( + 1 ) } ) . Then, R n 1 { + 1 } is {not} true in D M 4 [ , 01 ] : n ( ) ( ( DM 4 [ , 01 ] ( ) ) n D M 4 [ , 01 ] : n ) Mod ( C ( ) ) {under [ x k / a k ] k ( n + 1 ) }, in which case D ( Mod ( C n 1 ( ) ) Mod ( C n ( ) ) ) , and so C n 1 ( ) C n ( ) . In particular, DM 4 [ , 01 ] , being isomorphic to the consistent truth-singular subdirect product DM 4 [ , 01 ] : 2 of 2 × { DM 4 [ , 01 ] } , is a model of C 1 .
Proof. 
If R n 1 was not true in D , i.e., there was some b ¯ £ D n 1 ( { f , b , n } n ) n 1 such that n 1 D ( b ¯ ) D D { 1 , 1 ( 2 ( 1 ) ) } n , then, by Lemma 2.1, for each i n , there would be some f ( i ) ( n 1 ) such that b f ( i ) = a i , in which case, by the injectivity of a ¯ , f : n ( n 1 ) would be injective, and so we would have n ( n 1 ) . Finally, A D M 4 [ , 01 ] : 2 = ( Δ Δ 2 ( ( 2 2 Δ 2 ) 2 Δ 2 2 Δ 2 ) ) , in which case D DM 4 [ , 01 ] : 2 = { t , t } ¬ f , f A , while, for each 2 , π [ A ] = 2 2 , and so ( π 0 A ) hom S S ( DM 4 [ , 01 ] : 2 , DM 4 [ , 01 ] ) is injective, ((2.2)[11]) completing the argument. □
This, by (Theorem 2.8, [11]) and the Compactness Theorem [15], eventually yields:
Theorem 2.3 
C n ( ) n ( ω ( 1 ( + 1 ) ) ) is a strictly increasing countable chain of extensions of C ( ) , in which case it does not contain C ω ( ) , and so this is not {relatively} finitely-axiomatizable.
The secondary part of Corollary 2.2 inevitably raises the problem of finding an axiomatization of C relatively to C to be resolved in the next subsection.

2.1. Modus Ponens for Material Implication Versus Truth-Singularity

Let 0 | 1 x 0 1 ( x 0 1 | | x 0 1 ) Fm Σ { 0 1 } and R i , j ( ( i x j x 2 ) ( i x 1 j x 2 ) ) . We start from presenting the following quite immediate observation:
Lemma 2.4 
Let Σ Σ be a language and A a ∧-conjunctive Σ-matrix with ( A Σ ) DML . Suppose Σ Σ consists of constants alone. Then, ( A ) = { a ¯ A 2 b A , i , j 2 : A R i , j [ x k / a k ; x 2 / b ] k 2 } .
Lemma 2.5 
Let n ω , A ¯ S * { * } ( DM 4 [ , 01 ] ( ) ) n and B a consistent subdirect product of A ¯ . Then, n 0 , while { f ( n × { f } ) [ = B ] B , in which case t ( n × { t } ) [ = B ] D B ¬ f , and so { f , f , t , t } is an embedding of DM 4 [ , 01 ] Δ 2 into B , whereas} B is truth-non-empty iff all members of img A ¯ are so.
Proof. 
Take any a ( B D B ) , in which case there is some i n such that π i ( a ) { f , n } , and so n 0 . Likewise, for every j n , ( π j B ) hom ( B , A j ) , in which case, for any b D B , π j ( b ) D A j , and so A j is truth-non-empty, whenever B is so. (Consider any k n , in which case π k [ B ] = A k , and so there are some ( c | d ) ( B π i 1 [ A k | D A k ] ) . Then, e k ( c B B d ) ( B π k 1 [ { f } ] ) , in which case B n B ( e l ) l n = f , and so B B f = t , as required.) □
Corollary 2.5 
A ( DM 4 [ , 01 ] Δ 2 ) , being “embedable into the reduction of a sub-matrix of”/“isomorphic to” any consistent truth-non-empty /two-valued /(more specifically, classical) B Mod ( C ) , is a model of any inferentially consistent extension of C and defines a unique inferentially consistent two-valued {in particular, - classical} extension P C of C.
Proof. 
First, any matrix is both consistent and truth-non-empty iff its logic is inferentially consistent. Take any ( a | b ) ( B | D B ) , in which case a b , the sub-matrix D of B generated by { a , b } being both finitely-generated, consistent and truth-non-empty /“as well as two-valued and non-proper”, for ( a | b ) ( B | D B ) /“and 2 = | { a , b } | | B | | A | = 2 ”, so, by (Lemmas 2.7, 3.2 and Example 3.1 [11]), there are some n ω , some subdirect product E of some C ¯ S * ( DM 4 [ , 01 ] ) n and some h hom S S ( E , ( / ) ( D ) ) , E being both consistent and truth-non-empty, in view of ((2.2) [11]). Then, by Lemma 2.5, there is some g hom S ( A , E ) , in which case, by (Corollary 2.3, Example 3.1 and Lemma 3.2 [11]), ( g h ) hom S ( A , ( / ) ( D ) ) is injective /“and so surjective, as | A | = 2 = | D | ”. Finally, by (Theorem 2.8 [11]), any inferenrially consistent extension of C, being defined by the class of its models subsumed by the one of those of C, has a consistent truth-non-empty model, ((2.2) [11]) completing the argument. □
Corollary 2.7 
Let n ω , A ¯ S * ( DM 4 [ , 01 ] ) n and B a (simple) consistent subdirect product of A ¯ . Then, B is a model of MP ( { x 0 , x 0 x 1 } x 1 ) if(f) any of the following equivalent conditions hold:
(i)
B is truth-singular;
(ii)
D B = ( B { n × { t } } ) ;
(iii)
B = ( ( i n ( DM 4 [ , 01 ] A i ) ) B ) ;
(iv)
B S ( P ( DM 4 [ , 01 ] ) ) .
In particular, DM 4 [ , 01 ] Mod ( MP ) .
Proof. 
First, (i)⇒(ii) is by Lemma 2.5 and the inclusion D B ( B { n × { t } } ) , (ii/iii/iv)⇒(iii/iv/i) being immediate. Now, assume (i) holds. Consider any a D B and b B such that c ( B a B b ) D B , in which case B is truth-non-empty, and so, by Lemma 2.5, a = ( n × { t } ) . Then, B a = ( n × { f } ) , in which case D B c = b , and so B Mod ( MP ) . (Conversely, assume B Mod ( MP ) is truth-non-empty, in which case, by Lemma 2.5, t ( n × { t } ) D B , and so, for all d D B , e B and i , j 2 , since B MP [ x 0 / d , x 1 / e ] , while ( B t B e ) = ( ( n × { f } ) B e ) = e B ( B d B e ) , whereas both D B ( d | t ) B ( ( d | t ) B e ) , by the ∧-conjunctivity of B , ensuing from that of DM 4 [ , 01 ] , we have B R i , j [ x 0 / t , x 1 / d , x 2 / d ] , d being equal to t, in view of Lemma 2.4 and the simplicity of B . Thus, by the truth-singularity of truth-empty matrices, (ii) holds.) Finally, Corollary 2.2, the consistency of DM 4 [ , 01 ] and ((2.2) [11]) end the proof. □
This, by ((2.2) and Theorem 2.8 [11]) as well as Corollary 2.2, eventually yields:
Theorem 2.8 
C is the extension of C relatively axiomatized by MP .
On the other hand, DM 4 [ , 01 ] Δ 2 is the only (consistent) sub-matrix of DM 4 [ , 01 ] , being a model of the Excluded Middle Law axiom EM ( x 0 x 0 ) , because this is {not} true in DM 4 [ , 01 ] under [ x 0 / a ] , for all a ( { 2 2 } Δ 2 ) . Likewise, since, for all b 2 2 , ( DM 4 [ , 01 ] EM [ x 0 / b ] ) ( b n ) , a sub-matrix of DM 4 [ , 01 ] is a model of EM iff it is a sub-matrix of DM 4 [ , 01 ] { f , n , t } , defining the [bounded expansion of the] logic of paradox  L P [ 01 ] [16,17,18] (viz., the Σ -fragment of {any normal extension of} Relevance-Mingle R M { n } {where n ( ω 3 ) } [19]; cf. (Corollary 4.15 [14])). Finally, any extension of C, satisfying the Resolution rule RS ( { x 0 x 1 , x 0 x 1 } x 1 ) , true in DM 4 [ , 01 ] Δ 2 , satisfies MP . These observations, by ((2.2) and Corollary 2.9 [11]) as well as Corollary 2.6 and Theorem 2.8, immediately imply the following important interesting consequence, yielding a new insight into respective parts of (Corollary 5.3 [9]) and (Theorem 4.13 [14]):
Corollary 2.9 
P C | L P is the axiomatic extension of C | relatively axiomatized by EM . In particular, P C is the extension of L P / C relatively axiomatized by MP RS /“and EM ”.

2.2. Application to Bounded De Morgan Lattices

Recall that a [bounded] Kleene lattice [more traditionally, a Kleene algebra; cf., e.g., [20] is any [bounded] De Morgan lattice A with ideal £ A of its lattice reduct, their class [ B ] KL being the sub-variety of [ B ] DML relatively axiomatized by the identity ((6) [21]).
Let { x } , in which case DM 4 , 01 DM 4 , 01 , and so, by the double ()-[]-optional version of Theorem 2.3, (Theorem 3.4 [10]), (Lemma 3.1, Corollary 3.2 and Theorem 3.3 [14]) as well as the Compactness Theorem [15], we immediately get:
Corollary 2.10 
BDML Mod ( ( R n ) ) n ( ω 2 ) is a strictly decreasing countable chain of finitely-axiomatizable quasi-varities of bounded De Morgan lattices including BKL , in which case it does not cintain its imtersection ( BDML Mod ( C ω ) ) BKL , and so this is not {relatively} finitely-axiomatizable.
On the other hand, such is not applicable to the unbounded case, simply because, due to [21], it has been well-known that the lattice of quasi-varieties of De Morgan lattices is finite.

3. Conclusions

Thus, Theorem 2.3 definitely exhausts the issues raised in Section 1. In this connection, it is especially remarkable that this more than profound result, due to the equally profound universal part of the outstanding contribution [14] to General Algebraic Logic, in its turn, going back to the fundamental ones [10,12], has been successfully applied to the issue of the lattice of quasi-varieties of bounded De Morgan lattices including the variety of bounded Kleene lattices. Perhaps, the most acute problems remained still open are what are the cardinalities and structures of the infinite lattices under consideration. On the other hand, such rather minor points, proving beyond the scopes of the present work, are going to be discussed in detail elsewhere.

References

  1. S. C. Kleene, Introduction to metamathematics, D. Van Nostrand Company, New York, 1952.
  2. J. oś and R. Suszko. Remarks on sentential logics. Indagationes Mathematicae 1958, 20, 177–183. [Google Scholar] [CrossRef]
  3. E. Mendelson, Introduction to mathematical logic, 2nd ed., D. Van Nostrand Company, New York, 1979.
  4. H. Rasiowa, An algebraic approach to non-classical Logics, North-Holland Publishing Company, Amsterdam, 1974.
  5. H. Rasiowa and R. Sikorski, The mathematics of metamathematics, Państwowe Wydawnictwo Naukowe, Warszawa, 1963.
  6. A. R. Anderson and N. D. Belnap, Entailment, vol. 1, Princeton University Press, Princeton, 1975.
  7. 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.
  8. Dunn, J.M. Intuitive semantics for first-order-degree entailment and `coupled tree’. Philosophical Studies 1976, 29, 149–168. [Google Scholar] [CrossRef]
  9. Pynko, A.P. Characterizing Belnap’s logic via De Morgan’s laws. Mathematical Logic Quarterly, 1995; 41, 442–454. [Google Scholar]
  10. Pynko, A.P. Functional completeness and axiomatizability within Belnap’s four-valued logic and its expansions. Journal of Applied Non-Classical Logics Special Issue on Multi-Valued Logics. 1999, 9, 61–105. [Google Scholar] [CrossRef]
  11. Pynko, A.P. Four-valued expansions of Dunn-Belnap’s logic (I): Basic characterizations. Bulletin of the Section of Logic 2020, 49, 401–437. [Google Scholar] [CrossRef]
  12. Pynko, A.P. Definitional equivalence and algebraizability of generalized logical systems. Annals of Pure and Applied Logic 1999, 98, 1–68. [Google Scholar] [CrossRef]
  13. Pynko, A.P. Subquasivarieties of implicative locally-finite quasivarieties. Mathematical Logic Quarterly 2010, 56, 643–658. [Google Scholar] [CrossRef]
  14. Pynko, A.P. Subprevarieties versus extensions. Application to the logic of paradox. Journal of Symbolic Logic 2000, 65, 756–766. [Google Scholar] [CrossRef]
  15. A. I. Mal’cev, Algebraic systems, Springer Verlag, New York, 1965.
  16. Priest, G. The logic of paradox. Journal of Philosophical Logic 1979, 8, 219–241. [Google Scholar] [CrossRef]
  17. Priest, G. Sense, entailment and modus ponens. Journal of Philosophical Logic 1980, 9, 415–435. [Google Scholar] [CrossRef]
  18. Priest, G. To be and not to be: dialectical tense logic. Studia Logica 1982, 41, 249–268. [Google Scholar] [CrossRef]
  19. Dunn, J.M. Dunn, Algebraic completeness results for R-mingle and its extensions. Journal of Symbolic Logic 1970, 35, 1–13. [Google Scholar] [CrossRef]
  20. Balbes, B.; Dwinger, P. Distributive Lattices; University of Missouri Press: Columbia, Missouri, 1974. [Google Scholar]
  21. Pynko, A.P. Implicational classes of De Morgan lattices. Discrete mathematics 1999, 205, 171–181. [Google Scholar] [CrossRef]
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

© 2026 MDPI (Basel, Switzerland) unless otherwise stated