The sets of multifunctions are considered. A multifunction on a finite set A is a function defined on the set A and taking its subsets as values. Obviously, superposition in the usual sense does not work when working with multifunctions. Therefore, we need a new definition of superposition. Two ways of defining superposition are usually considered: the first is based on the union of subsets of the set A, and in this case the closed sets containing all the projections are called multiclones, and the second is the intersection of the subsets of A, and the closed sets containing all projections are called partial ultraclones. The set of multifunctions on A on the one hand contains all the functions of |A|-valued logic and on the other, is a subset of functions of 2^|A|-valued logic with superposition that preserves these subsets.

For functions of k-valued logic, the problem of their classification is interesting. One of the known variants of the classification of functions of k-valued logic is one in which functions in a closed subset B of a closed set M can be divided according to their belonging to the classes that are complete in M. In this paper, the subset of B is the set of all Boolean functions, and the set of M is the set of all multifunctions on the two-element set, and the partial maximal ultraclones are pre-complete classes.

Sergey Badmaev, assistant, Buryat State University, 24 a, Smolin st., Ulan-Ude, 670000, Russian Federation, e-mail: badmaevsa@mail.ru

Badmaev S.A. On the Classes of Boolean Functions Generated by Maximal Partial Ultraclones. The Bulletin of Irkutsk State University. Series Mathematics, 2019, vol. 27, pp. 3-14. (in Russian) https://doi.org/10.26516/1997-7670.2019.27.3

1. Badmaev S.A., Sharankhaev I.K. On Maximal Clones of Partial Ultrafunctions on a Two-element Set. The Bulletin of Irkutsk State University. Series Mathematics, 2016, vol. 16, pp. 3-18. (in Russian)
2. Badmaev S.A. A Completeness Criterion of Set of Multifunctions in Full Partial Ultraclone of Rank 2. Siberian Electronic Mathematical Reports, 2017, vol. 15, pp. 450-474. (in Russian) https://doi.org/10.17377/semi.2018.15.040
3. Zamaratskaya S.V., Panteleev V.I. On Maximal Clones of Ultrafunctions of Rank 2. The Bulletin of Irkutsk State University.  Series  Mathematics,  2016,  vol. 15,   pp. 26-37. (in Russian)
4. Zamaratskaya S.V., Panteleev V.I. Classification and Types of Bases of All Ultrafunctions on Two-Element Set. The Bulletin of Irkutsk State University. Series Mathematics, 2016, vol. 16, pp. 58-70. (in Russian)
5. Zinchenko A.S., Panteleev V.I. On Classes of Hyperfunctions of Rank 2 Generated by Maximal Multiclones. The Bulletin of Irkutsk State University. Series Mathematics, 2017, vol. 21, pp. 61-76. (in Russian) https://doi.org/10.26516/1997-7670.2017.21.61
6. Kazimirov A.S., Panteleyev V.I., Tokareva L.V. Classification and Enumeration of Bases in Clone of All Hyperfunctions on Two-Elements Set. The Bulletin of Irkutsk State University. Series Mathematics, 2014, vol. 7, pp. 61-78. (in Russian)
7. Kazimirov A.S., Panteleyev V.I. On the Classes of  Boolean Functions Generated by Maximal Multiclones. The Bulletin of Buryat State University. Mathematics and Informatics, 2015, vol. 9, pp. 16-22. (in Russian)
8. Panteleyev V.I. On Two Maximal Multiclones and Partial Ultraclones. The Bulletin of Irkutsk State University. Series Mathematics, 2012, vol. 5, no. 4, pp. 46-53. (in Russian)
9. Yablonskij S.V. On the Superpositions of Logic Functions. Mat. Sbornik, 1952, vol. 30, no. 2(72), pp. 329-348. (in Russian)
10. Miyakawa M., Stojmenovic I., Lau D., Rosenberg I. Classificationand basis enumerations in many-valued logics. Proc. 17th International Symposium on Multi-Valued logic. Boston, 1987, pp. 151-160.
11. Miyakawa M., Stojmenovi´c I., Lau D., Rosenberg I. Classificationand basis enumerations of the algebras for partial functions. Proc. 19th International Symposium on Multi-Valued logic. Rostock, 1989, pp. 8-13. https://doi.org/10.1109/ISMVL.1989.37752
12. Miyakawa M., Stojmenovic I., Rosenberg I. Classification of three-valued logical functions preserving 0. Discrete Applied Mathematics, 1990, vol. 28, pp. 231-249. https://doi.org/10.1016/0166-218X(90)90005-W