Class of discrete functions from a finite set A to set of all subsets of A is a natural generalization of the class of many-valued functions on A (k-valued logic functions). Functions of this type are called multifunctions or multioperations on A, and are used, for example, in the solution of the functional equations, in logical and technical systems. It is obvious that the superposition in the usual sense not appropriate for multifunctions, therefore, we need to expand the standard concept of superposition. We note there are various ways to determine the operation of superposition of multifunctions, one of such methods is considered in this paper. Multifunctions on A with this superposition are called partial ultrafunctions on A. In this article starting set A is two-element set and we consider classical problem of theory of discrete functions – description of clones – sets of functions closed with respect to the operation of superposition and containing all the projections. We got a description of the two maximal clones of partial ultrafunctions of a two-element set by the predicate approach.

MSC

68R01

1. Badmaev S.A., Sharankhaev I.K. Minimal Partial Ultraclones on a Two-element Set (in Russian). Izvestiya Irk. Gos. Univ. Ser. Matematika, 2014, vol. 9, pp. 3-9.

2. Badmaev S.A. On Complete Sets of Partial Ultrafunctions on a Two-element Set (in Russian). Vestnik Buryat. Gos. Univ. Matem., Inform., 2015, no 3, pp. 61-67.

3. 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.

4. Panteleyev V.I. Completeness Criterion for Sub-defined Partial Boolean Functions (in Russian). Vestnik Novosibir. Gos. Univ. Ser.: Matem., Mechan., Inform., 2009, vol. 9, no 3, pp. 95-114.

5. 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.