Some combinatorial characteristics of closure operations

The aim of this paper investigates some combinatorial characteristics of minimal key and antikey of closure operations. We also give effective algorithms finding minimal keys and antikeys of closure operations. We estimate these algorithms. Some remarks on the closeness of closure operations class under the union and direct product operations are also studied in this paper.