On the action of the implicative closure operator on the set of partial functions of the multivalued logic

References

[1] Alekseev V.B., Voronenko A. A., “On some closed classes in partial two-valued logic”, Discrete Math. Appl., 4:5 (1994).10.1515/dma.1994.4.5.401Suche in Google Scholar

[2] Kuznetsov A.V., “On the means for detecting irreducibility and inexpressibility”, Logical Derivation, Nauka, Moscow (in Russian).Suche in Google Scholar

[3] Lo Chukai, “Maximal closed sets in the set of partial many-valued logic functions”, Acta Math. Sinica, 27 (1984), 795–800 (in Chinese).Suche in Google Scholar

[4] Lo Chukai, “The completeness theory of partial many-valued logic functions”, Acta Math. Sinica, 27 (1984), 676–683 (in Chinese).Suche in Google Scholar

[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.10.1515/dma.1999.9.6.563Suche in Google Scholar

[6] Marchenkov S.S., “Equationally closed classes of partial Boolean functions”, Diskret. Anal. Issled. Oper., 15:1 (2008), 82–97 (in Russian).Suche in Google Scholar

[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.10.1515/DMA.2008.028Suche in Google Scholar

[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).Suche in Google Scholar

[9] Marchenkov S.S., “Positively closed classes of three-valued logic”, J. Appl. Industr. Math., 8:2 (2014), 256–266.10.1134/S1990478914020124Suche in Google Scholar

[10] Marchenkov S.S., “Extensions of the positive closure operator by using logical connectives”, J. Appl. Industr. Math., 12:4 (2018), 678–683.10.1134/S1990478918040087Suche in Google Scholar

[11] Marchenkov S.S., Popova A.A., “Positively closed classes of partial Boolean functions”, Moscow Univ. Comput. Math. Cyber., 32 (2008), 147–151.10.3103/S0278641908030059Suche in Google Scholar

[12] Romov B. A., “Maximal subalgebras of algebras of partial multivalued logic functions”, Cybernetics, 16 (1980), 31-41.10.1007/BF01099358Suche in Google Scholar

[13] Romov B. A., “The algebras of partial functions and their invariants”, Cybernetics, 17 (1981), 157–167.10.1007/BF01069627Suche in Google Scholar

[14] Romov B. A., “The completeness problem in the algebra of partial functions of finite-valued logic”, Cybernetics, 26 (1990), 133–138.10.1007/BF01068239Suche in Google Scholar

[15] Freivald R.V., “Completeness criterion for partial algebra logic functions and multivalued logic”, DokladyMathematics, 167:6 (1966), 1249–1250 (in Russian).Suche in Google Scholar

[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.Suche in Google Scholar

[17] Fleischer I., Rosenberg I.G., “The Galois connection between partial functions and relations”, Pacific J. Math., 79:1 (1978), 93–98.10.2140/pjm.1978.79.93Suche in Google Scholar

[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.Suche in Google Scholar

[19] Rosenberg I.G., “Galois theory for partial algebras”, Lecture Notes in Math., 1004 (1983), 257–272.10.1007/BFb0063443Suche in Google Scholar