×

On the action of the implicative closure operator on the set of partial functions of the multivalued logic. (English. Russian original) Zbl 1524.03020

Discrete Math. Appl. 31, No. 3, 155-164 (2021); translation from Diskretn. Mat. 32, No. 1, 60-73 (2020).
Summary: On the set \(P_k^*\) of partial functions of the \(k\)-valued logic, we consider the implicative closure operator, which is the extension of the parametric closure operator via the logical implication. It is proved that, for any \(k \geq 2\), the number of implicative closed classes in \(P_k^*\) is finite. For any \(k \geq 2\), in \(P_k^*\) two series of implicative closed classes are defined. We show that these two series exhaust all implicative precomplete classes. We also identify all 8 atoms of the lattice of implicative closed classes in \(P_3^*\).

MSC:

03B50 Many-valued logic
Full Text: DOI

References:

[1] Alekseev V.B., Voronenko A. A., “On some closed classes in partial two-valued logic”, Discrete Math. Appl., 4:5 (1994). · Zbl 0818.06013
[2] Kuznetsov A.V., “On the means for detecting irreducibility and inexpressibility”, Logical Derivation, Nauka, Moscow (in Russian).
[3] Lo Chukai, “Maximal closed sets in the set of partial many-valued logic functions”, Acta Math. Sinica, 27 (1984), 795-800 (in Chinese). · Zbl 0594.03011
[4] Lo Chukai, “The completeness theory of partial many-valued logic functions”, Acta Math. Sinica, 27 (1984), 676-683 (in Chinese). · Zbl 0552.03017
[5] Marchenkov S.S., “On expressibility of functions of many-valued logic in some logical-functional languages”, Discrete Math. Appl., 9:6 (1999), 563-581. · Zbl 0974.03028
[6] Marchenkov S.S., “Equationally closed classes of partial Boolean functions”, Diskret. Anal. Issled. Oper., 15:1 (2008), 82-97 (in Russian). · Zbl 1249.06035
[7] Marchenkov S.S., “The closure operator with the equality predicate branching on the set of partial Boolean functions”, Discrete Math. Appl., 18:4 (2008), 381-389. · Zbl 1171.94381
[8] Marchenkov S.S., “The E-closure operator on the set of partial functions of a multivalued logic”, Matem. Vopr. Kibern., 18, Fizmatlit, Moscow, 2013, 227-238 (in Russian).
[9] Marchenkov S.S., “Positively closed classes of three-valued logic”, J. Appl. Industr. Math., 8:2 (2014), 256-266. · Zbl 1324.03004
[10] Marchenkov S.S., “Extensions of the positive closure operator by using logical connectives”, J. Appl. Industr. Math., 12:4 (2018), 678-683. · Zbl 1438.03002
[11] Marchenkov S.S., Popova A.A., “Positively closed classes of partial Boolean functions”, Moscow Univ. Comput. Math. Cyber., 32 (2008), 147-151. · Zbl 1160.03042
[12] Romov B. A., “Maximal subalgebras of algebras of partial multivalued logic functions”, Cybernetics, 16 (1980), 31-41. · Zbl 0453.03068
[13] Romov B. A., “The algebras of partial functions and their invariants”, Cybernetics, 17 (1981), 157-167. · Zbl 0466.03026
[14] Romov B. A., “The completeness problem in the algebra of partial functions of finite-valued logic”, Cybernetics, 26 (1990), 133-138. · Zbl 0752.03010
[15] Freivald R.V., “Completeness criterion for partial algebra logic functions and multivalued logic”, DokladyMathematics, 167:6 (1966), 1249-1250 (in Russian).
[16] Freivald, R.V., “Functional completeness for nontotal Boolean functions”, Diskretnyi analiz (Discrete Analysis), Inst. Mat. Sib. Otd. Akad. Nauk SSSR, Novosibirsk, 1966, 55-68. · Zbl 0199.00602
[17] Fleischer I., Rosenberg I.G., “The Galois connection between partial functions and relations”, Pacific J. Math., 79:1 (1978), 93-98.
[18] Haddad L., Rosenberg I., “Critére général de complétude pour les algébres partielles finies”, C. r. Acad. sci., 304:17 (1987), 507-509. · Zbl 0617.08008
[19] Rosenberg I.G., “Galois theory for partial algebras”, Lecture Notes in Math., 1004 (1983), 257-272. · Zbl 0518.08006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.