Key (critical) relations preserved by a weak near-unanimity function

DOI10.1007/S00012-017-0426-3MaRDI QIDQ522228zbMATH OpenOpenAlexFDO

Authors D. N. Zhuk

Publication date 13 April 2017

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.04597

zbMATH Keywords

clonesrelational clonecritical relationessential relationkey relationweak near-unanimity operation

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Operations and polynomials in algebraic structures, primal algebras (08A40)

Abstract: In the paper we introduce a notion of a key relation, which is similar to the notion of a critical relation introduced by Keith A.Kearnes and 'Agnes Szendrei. All clones on finite sets can be defined by only key relations. In addition there is a nice description of all key relations on 2 elements. These are exactly the relations that can be defined as a disjunction of linear equations. In the paper we show that, in general key relations do not have such a nice description. Nevertheless, we obtain a nice characterization of all key relations preserved by a weak near-unanimity function. This characterization is presented in the paper.

Recommendations

• Clones on three elements preserving a binary relation
• scientific article; zbMATH DE number 1164025
• Publication:4207614
• Abstract relations between functional clones
• scientific article; zbMATH DE number 3853165

Cites work

• scientific article; zbMATH DE number 3317731 (Why is no real title available?)
• Bestimmung der Ordnung Maximaler Klassen von Funktionen der k‐Wertigen Logik
• Classifying the Complexity of Constraints Using Finite Algebras
• Constraints, consistency and closure
• Existence theorems for weakly symmetric operations
• Flow of a viscous fluid through a porous medium bounded by a vertical surface
• Function Algebras on Finite Sets
• Recent Results on the Algebraic Approach to the CSP
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• The cardinality of the set of all clones containing a given minimal clone on three elements
• The lattice of all clones of self-dual functions in three-valued logic
• The predicate method to construct the Post lattice

Cited in

(5)

• Relations compatible with near unanimity operations
• Menger systems of idempotent cyclic and weak near-unanimity multiplace functions
• scientific article; zbMATH DE number 7536113 (Why is no real title available?)
• Submaximal clones over a three-element set up to minor-equivalence
• Existence of cube terms in finite algebras

This page was built for publication: Key (critical) relations preserved by a weak near-unanimity function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522228)