Meet-reducible submaximal clones determined by two central relations
From MaRDI portal
Publication:5223094
DOI10.1142/S1793557119500645zbMATH Open1484.08006arXiv1610.07834OpenAlexW2963406056MaRDI QIDQ5223094FDOQ5223094
Authors:
Publication date: 5 July 2019
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1610.07834
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
Relational systems, laws of composition (08A02) Operations and polynomials in algebraic structures, primal algebras (08A40)
Cites Work
- Function Algebras on Finite Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Binary central relations and submaximal clones determined by nontrivial equivalence relations.
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Meet-irreducible submaximal clones determined by nontrivial equivalence relations
- Bestimmung der Ordnung Maximaler Klassen von Funktionen der k‐Wertigen Logik
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)
