Meet-reducible submaximal clones determined by two central relations
From MaRDI portal
Publication:5223094
Abstract: Let rho and sigma be two central relations on a finite set A. It is known that the clones Pol(rho) and Pol(sigma) which consists of all operations on A that preserve rho respectively sigma are among the maximal clones on A. In this paper, we find all central relations sigma such that the join clone of Pol(rho) and Pol(sigma) is a maximal subclone of Pol(rho) where rho is a fixed central relation.
Recommendations
- Meet-irreducible submaximal clones determined by nontrivial equivalence relations
- Binary central relations and submaximal clones determined by nontrivial equivalence relations.
- Category equivalences of clones
- Clones on three elements preserving a binary relation
- All maximal clones containing a crown
Cites work
- scientific article; zbMATH DE number 3972929 (Why is no real title available?)
- scientific article; zbMATH DE number 3985299 (Why is no real title available?)
- scientific article; zbMATH DE number 3790426 (Why is no real title available?)
- scientific article; zbMATH DE number 3231913 (Why is no real title available?)
- Bestimmung der Ordnung Maximaler Klassen von Funktionen der k‐Wertigen Logik
- Binary central relations and submaximal clones determined by nontrivial equivalence relations.
- Function Algebras on Finite Sets
- Meet-irreducible submaximal clones determined by nontrivial equivalence relations
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
Cited in
(3)
This page was built for publication: Meet-reducible submaximal clones determined by two central relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223094)