Abstract:
In recent years, the direction associated with the study of maps from a finite set A to the set of all subsets of the set A, including the empty one, has been intensively developing. Such mappings are called multifunctions on A, as well as hyperfunctions on A, if an empty subset is excluded from the subsets under consideration. It is not difficult to see that the so-called undefined or undefined functions, which are studied in many works, are most directly related to this field of research. The power of the set A is called the rank of multifunction or hyperfunction. Obviously, multifunctions and hyperfunctions generalize well-known functions of k-valued logic, however, it should be noted that the usual superposition of functions of k-valued logic is not suitable for multifunctions and hyperfunctions. Two types of superpositions are most often considered here, one of them leads to sets closed relative to the superposition, which are called multiclones and hyperclones, and for the second type of superposition, closed sets are called ultraclones and partial ultraclones. In this article, the elements of the rank 2 ultraclone lattice are considered. By now, all the maximum and minimum elements of this lattice are known. For example, Panteleev V.I. described all maximal ultraclones in the predicate language, which allowed us to prove the completeness criterion of an arbitrary system of hyperfunctions of rank 2. We managed to prove the completeness criterion in the maximal ultraclone of linear hyperfunctions of rank 2. Thus, all submaximal ultraclones of linear hyperfunctions are described.
Keywords:hyperfunction, linear function, closed set, ultraclone, lattice.
Fulltext:
PDF file (737 kB)