Open AccessClassification of Multioperations of Rank 2 by E-precomplete Sets
Author(s) -
V. I. Panteleev,
L. V. Riabets
Publication year - 2020
Publication title -
izvestiâ irkutskogo gosudarstvennogo universiteta. seriâ "matematika"/izvestiâ irkutskogo gosudarstvennogo universiteta. seria matematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.411
H-Index - 3
eISSN - 2541-8785
pISSN - 1997-7670
DOI - 10.26516/1997-7670.2020.34.93
Subject(s) - mathematics , predicate (mathematical logic) , operator (biology) , composition operator , closure operator , cardinality (data modeling) , discrete mathematics , combinatorics , algebra over a field , computer science , data mining , finite rank operator , pure mathematics , closed set , biochemistry , banach space , chemistry , repressor , transcription factor , gene , programming language
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.