The existence of a near-unanimity term in a finite algebra is decidable

DOI10.2178/JSL/1245158096zbMATH Open1174.08002OpenAlexW2092845782MaRDI QIDQ3399189FDOQ3399189

Authors: M. Maróti 

Publication date: 29 September 2009

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1245158096

Recommendations

• Deciding the existence of quasiweak near unanimity terms in finite algebras
• On the (un)decidability of a near-unanimity term
• The existence of a near-unanimity function is decidable
• Decidability of elementary theories of certain finitely defined algebras
• A decidable equational theory with undecidable membership problem for finite algebras
• Finitely related algebras in congruence distributive varieties have near unanimity terms
• Dualities and algebras with a near-unanimity term
• Computer Science Logic
• Decidability problem for finite Heyting algebras
• Decidability of univariate real algebra with predicates for rational and integer powers

zbMATH Keywords

decidabilityfinite algebraclone of operationsnear-unanimity operation

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Congruence modularity, congruence distributivity (08B10) Operations and polynomials in algebraic structures, primal algebras (08A40)

Cites Work

• Existence theorems for weakly symmetric operations
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Function Algebras on Finite Sets
• Kneser's conjecture, chromatic number, and homotopy
• Constraints, consistency and closure
• Near unanimity: An obstacle to general duality theory
• Polynomial interpolation and the Chinese remainder theorem for algebraic systems
• On the (un)decidability of a near-unanimity term

Cited In (16)

• Title not available (Why is that?)
• On the (un)decidability of a near-unanimity term
• Finite degree clones are undecidable
• A short introduction to clones.
• The decidability of the affine completeness generation problem.
• Between an n-ary and an n + 1-ary near-unanimity term
• Testing for edge terms is decidable
• Finitely related algebras in congruence distributive varieties have near unanimity terms
• Near unanimity: An obstacle to general duality theory
• Deciding the existence of minority terms
• Existence of cube terms in finite algebras
• Title not available (Why is that?)
• Near-unanimity is decomposable
• The existence of a near-unanimity function is decidable
• Title not available (Why is that?)
• Near-Unanimity Polymorphisms on Structures with Finite Duality

This page was built for publication: The existence of a near-unanimity term in a finite algebra is decidable

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