Upward Saturated Hyperclones

Hyperoperations are mappings that assign a non-void subset of a set to each n-tuple of elements from the set. They present a fundamental notion for modeling non deterministic processes. Even though for each non deterministic automaton there is a language equivalent deterministic automaton, they do not have the same behavior. As behavior of concurrent processes took place in emerging fields of theoretical computer science, the necessity for development of algebraic theory of hyperstructures significantly increased. In [9] and [10] Rosenberg introduced the notion of a hyperclone as a subuniverse of the algebra of hyperoperations (HA, ◦, ζ, τ, , π2 1 ) whose fundamental operations are generalization of Mal’tsev-type operations and a projection. It can equivalently be defined as a composition closed set of hyperoperations containing all projections. The set of all hyperclones ordered by set inclusion forms an algebraic lattice. The least element and the greatest element of the lattice are the set of all projections and the set of all hyperoperations, respectively. The lattice has continuum cardinality even on a twoelement set (see [4]).

[1]  Ágnes Szendrei,et al.  Clones in universal algebra , 1986 .

[2]  Boris A. Romov Hyperclones on a finite set , 1997, Proceedings 1997 27th International Symposium on Multiple- Valued Logic.

[3]  Jovanka Pantovic,et al.  Maximal Hyperclones Determined by Monotone Operations , 2011, 2011 41st IEEE International Symposium on Multiple-Valued Logic.

[4]  Boris A. Romov Restriction-Closed Hyperclones , 2007, 37th International Symposium on Multiple-Valued Logic (ISMVL'07).

[5]  D. Lau,et al.  Function algebras on finite sets : a basic course on many-valued logic and clone theory , 2006 .

[6]  Reinhard Pöschel,et al.  Funktionen- und Relationenalgebren , 1979 .

[7]  Jovanka Pantovic,et al.  Three Classes of Maximal Hyperclones , 2012, J. Multiple Valued Log. Soft Comput..

[8]  D. Lau,et al.  Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics) , 2006 .

[9]  I.G. Rosenberg An algebraic approach to hyperalgebras , 1996, Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96).

[10]  Ferdinand Börner Basics of Galois Connections , 2008, Complexity of Constraints.

[11]  Ivo G. Rosenberg Multiple-valued hyperstructures , 1998, Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138).