Abstract
We consider the set of functions of countable-valued logic and the closure operator based on systems of functional equation (FE-closure). We prove that the cardinality of the set of all FE-precomplete classes is hypercontinuum.
Originally published in Diskretnaya Matematika (2016) 28, №2, 51–57 (in Russian)
Funding source: Russian Foundation for Basic Research
Award Identifier / Grant number: 13-01-00958
Funding statement: Research was supported by the Russian Foundation for Basic Research, project 13-01-00958.
References
[1] Berezin S. A., “An algebra of unate primitive recursive functions with iteration operation of general form”, Cybernetics, 12:3 (1976), 346-353.10.1007/BF01070012Search in Google Scholar
[2] Berezin S. A., “Maximal subalgebras of recursive function algebras”, Cybernetics, 14:6 (1978), 935-938.10.1007/BF01070293Search in Google Scholar
[3] Gavrilov G. P., “On the functional completeness in countably-valued logics”, Problemy kibernetiky, 15 (1965), 5-64 (in Russian).Search in Google Scholar
[4] Kalinina I. S., “Action of an FE-Closure operator on functions of countable-valued logic”, Moscow University Computational Mathematics and Cybernetics, 38:3 (2014), 134-138.10.3103/S0278641914030054Search in Google Scholar
[5] Kalinina I. S., “On some properties of FE-closure operator in countably-valued logic”, Izv. vyssh. uchebn. zaved. Povolzhskiy region. Fiz.-matem. nauki, 2014, № 4, 37-46 (in Russian).Search in Google Scholar
[6] Cohn P. M, Universal Algebra, Harper & Row, New York, 1965.Search in Google Scholar
[7] Mal’tsev A. I., Algebraic systems, Springer-Verlag, Berlin · Heidelberg, 1973, 320 pp.10.1007/978-3-642-65374-2Search in Google Scholar
[8] Marchenkov S. S., “On the cardinality of the precomplete classes set in some function classes of countably-valued logic”, Problemy kibernetiki, 38 (1981), 109-116 (in Russian).Search in Google Scholar
[9] Marchenkov S. S., Functional systems with superposition operation, Fizmatlit, Moscow, 2004 (in Russian), 103 pp.Search in Google Scholar
[10] Marchenkov S. S., “The closure operator in a multivalued logic based on functional equations”, J. Appl. Indust. Math., 5:3 (2011), 383-390.10.1134/S1990478911030100Search in Google Scholar
[11] Marchenkov S. S., “FE classification of functions of many-valued logic”, Moscow University Computational Mathematics and Cybernetics, 35:2 (2011), 89-96.10.3103/S0278641911020063Search in Google Scholar
[12] Marchenkov S. S., “On classifcatons of many-valued logic functions by means of automorphism groups”, Diskretn. Anal. Issled. Oper., 18:4 (2011), 66-76 (in Russian).Search in Google Scholar
[13] Marchenkov S. S., “Defnability in the language of functional equations of a countable-valued logic”, Discrete Math. Appl., 23:5-6 (2013), 451-462.10.1515/dma-2013-0031Search in Google Scholar
[14] Marchenkov S. S., Functional equations of discrete mathematics, Fizmatlit, Moscow, 2013 (in Russian), 58 pp.Search in Google Scholar
[15] Marchenkov S. S., Kalinina I. S., “The FE-closure operator in countable-valued logic”, Moscow Univ. Comput. Math. Cyber., 37:3 (2013), 131-136.10.3103/S0278641913030084Search in Google Scholar
[16] Marchenkov S. S., Fedorova V. S., “On solutions to the systems of functional Boolean equations”, J. Appl. Indust. Math., 3:4 (2009), 476-481.10.1134/S1990478909040061Search in Google Scholar
[17] Marchenkov S. S., Fedorova V. S., “On solutions to systems of functional equations of multiple-valued logic”, 79:3 (2009), 382-383.10.1134/S1064562409030223Search in Google Scholar
[18] Marchenkov S.S., Fedorova V. S., “Solutions to the systems of functional equations of multivalued logic”, Moscow University Computational Mathematics and Cybernetics, 33:4 (2009), 197-201.10.3103/S0278641909040049Search in Google Scholar
[19] Sokolov V. A., “Maximal subalgebras of the algebra of all partially recursive functions”, Cybernetics, 8:1 (1972), 76-79.10.1007/BF01069135Search in Google Scholar
[20] Jech T., Set theory, Springer, Berlin, 2006,772 pp.Search in Google Scholar
[21] Macpherson H. D., Neumann P. M., “Subgroups of infinite symmetric groups”, J. London Math. Soc, 42 (1990), 64-84.10.1112/jlms/s2-42.1.64Search in Google Scholar
© 2017 Walter de Gruyter GmbH, Berlin/Boston