Classification of Multioperations of Rank 2 by E-precomplete Sets | Zendy

V. I. Panteleev | Zendy; L. V. Riabets | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Classification of Multioperations of Rank 2 by E-precomplete Sets

Author(s) -

V. I. Panteleev,

L. V. Riabets

Publication year - 2020

Publication title -

the bulletin of irkutsk state university series mathematics

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 , composition operator , operator (biology) , predicate (mathematical logic) , cardinality (data modeling) , closure operator , equivalence relation , discrete mathematics , combinatorics , equivalence (formal languages) , algebra over a field , finite rank operator , pure mathematics , computer science , closed set , data mining , biochemistry , chemistry , repressor , transcription factor , banach space , 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research