The existence of a near-unanimity function is decidable

DOI10.1007/s00012-013-0259-7zbMath1350.08001arXiv1108.1671OpenAlexW2049472943MaRDI QIDQ2449447

Dmitriy N. Zhuk

Publication date: 8 May 2014

Published in: Algebra Universalis (Search for Journal in Brave)

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

zbMATH Keywords

decidabilityrelational structurenear-unanimityessential predicate

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Relational systems, laws of composition (08A02)

Related Items (2)

Dualities and algebras with a near-unanimity term ⋮ Deciding absorption in relational structures

Cites Work

• Unnamed Item
• Structure of clones in the precomplete class of self-dual functions in three-valued logic
• Polynomial interpolation and the Chinese remainder theorem for algebraic systems
• Constraints, consistency and closure
• The cardinality of the set of all clones containing a given minimal clone on three elements
• On the (un)decidability of a near-unanimity term
• Closed systems of functions and predicates
• Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• A polynomial-time algorithm for near-unanimity graphs
• The existence of a near-unanimity term in a finite algebra is decidable
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms
• Order varieties and monotone retractions of finite posets

This page was built for publication: The existence of a near-unanimity function is decidable