Classification of Multioperations of Rank 2 by E-precomplete Sets
V.I. Panteleev, L.V. Ryabets
Известия Иркутского государственного университета: Серия "Математика" · 2020
doi:10.26516/1997-7670.2020.34.93 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper multioperations defined on a two-element set and their closure operator based on composition operator and the equality predicate branching operator is considered. The composition operator is based on union of sets. The classification of multioperations based on their membership in precomplete sets has been obtained. It is shown that the number of equivalence classes is 129. All types of bases are described and it is proved that the maximum cardinality of a basis is 4.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.