RUS  ENG
Full version
JOURNALS // Bulletin of Irkutsk State University. Series Mathematics // Archive

Bulletin of Irkutsk State University. Series Mathematics, 2019 Volume 29, Pages 68–85 (Mi iigum385)

This article is cited in 2 papers

Algebraic and logical methods in computer science and artificial intelligence

The completeness criterion for closure operator with the equality predicate branching on the set of multioperations on two-element set

V. I. Panteleev, L. V. Riabets

Irkutsk State University, Irkutsk, Russian Federation

Abstract: Multioperations are operations from a finite set A to set of all subsets of A. The usual composition operator leads to a continuum of closed sets. Therefore, the research of closure operators, which contain composition and other operations becomes necessary. In the paper, the closure of multioperations that can be obtained using the operations of adding dummy variables, identifying variables, composition operator, and operator with the equality predicate branching is studied. We obtain eleven precomplete closed classes of multioperations of rank 2 and prove the completeness criterion. The diagram of inclusions for one of the precomplete class is presented.

Keywords: closure, equality predicate, multioperation, closed set, composition, completeness criterion.

UDC: 519.716

MSC: 03B50, 08A99

Received: 05.08.2019

Language: English

DOI: 10.26516/1997-7670.2019.29.68



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024