«THE BULLETIN OF IRKUTSK STATE UNIVERSITY». SERIES «MATHEMATICS»
«IZVESTIYA IRKUTSKOGO GOSUDARSTVENNOGO UNIVERSITETA». SERIYA «MATEMATIKA»
ISSN 1997-7670 (Print)
ISSN 2541-8785 (Online)

## Minimal Partial Ultraclones on a Two-Element Set

Author(s)
S. A. Badmaev, I. K. Sharankhaev
Abstract

Set of functions from a finite set A to set of all subsets of A is a natural generalization of the set of many-valued functions on A (k-valued logic functions). These generalized functions, which are called multifunctions, often are regarded as incompletely defined functions. Partial functions, hyperfunctions, ultrafunctions, partial hyperfunctions, partial ultrafunctions on A are arised depending on the type of multifunctions and superposition.

In the theory of discrete functions the classical problem is description of lattice of clones - sets of functions that are closed with respect to superposition and contain all projections. Full description of a lattice is obtained only for Boolean functions by Emil Post in 1921. Thus this problem remains open more than 90 years for other discrete functions. Because of difficulty of this problem lattice fragments are studied, for example, the minimum and maximum elements, different intervals. In particular, we note that the descriptions of all minimal clones are known for Boolean functions, 3-valued logic functions, partial functions on two-element and three-element sets, hyperfunctions and partial hyperfunctions on a two-element set.

In this paper we consider ultrafunctions and partial ultrafunctions on a two-element set. A description of all minimal clones for these classes of multifunctions is got.

Keywords
minimal clone partial ultraclone multifunction partial ultrafunction superposition
UDC
519.716
References

1. Alekseev V.B., Voronenko A.A. On Some Closed Sets in Partial Two-Valued Logic. Discrete Mathematics and Applications, 1994, 4:5, pp. 401-419.

2. Panteleyev V.I. Completeness Criterion for Incompletely Defined Boolean Functions (in Russian). Vestnik Samar. Gos. Univ. Est.-Naush. Ser., 2009, vol. 2, no. 68, pp. 60-79.

3. Panteleyev V.I. On Two Maximal Multiclones and Partial Ultraclones (in Russian). Izvestiya Irk. Gos. Univ. Ser. Matematika, 2012, vol. 5, no. 4, pp. 46-53.

4. Tarasov V.V. Completeness Criterion for Partial Logic Functions (in Russian). Problemy Kibernetiki, Moscow, Nauka, 1975, vol. 30, pp. 319-325.

5. Freivald R.V. Completeness Criterion for Partial Functions of Algebra Logic and Many-valued Logics (in Russian). Dokl. Akad. Nauk of USSR, 1967, vol. 167, pp. 1249-1250.

6. Borner F., Haddad L., Poschel R. Minimal Partial Clones. Bulletin of the Austral. Math. Soc., 1991, vol. 44, no. 3, pp. 405-415.

7. Borner F., Haddad L., Poschel R. A Note on Minimal Partial Clones. Proceedings of 21th IEEE International Symposium on Multiple-Valued Logic (ISMVL), 1991, pp. 262-267.

8. Csakany B. All Minimal Clones on the Three-Element Set. Acta cybernetica, 1983, no. 6, pp. 227-238.

9. Pantovic J., Vojvodic G. Minimal Partial Hyperclones on a Two-Element Set. Proceedings of 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL), 2004, pp. 115-119.

10. Post E. L. Introduction to a General Theory of Elementary Propositions. American Journal of Math., 1921, vol. 43.

11. Post E. L. Two-Valued Iterative Systems of Mathematical Logic. Annals of Math. Studies. Princeton, Univer. Press, 1941, vol. 5, 122 p.

12. Rosenberg I. G. Minimal Clones I: the Five Types. In Lectures in Universal Algebra 43, Colloq. Math. Soc. J. Bolyai, 1983, pp. 405-427.