On the (un)decidability of a near-unanimity term
From MaRDI portal
Publication:2474099
DOI10.1007/S00012-007-2037-XzbMATH Open1136.08003OpenAlexW1994368615MaRDI QIDQ2474099FDOQ2474099
Authors: M. Maróti 
Publication date: 5 March 2008
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/4592/1/1116613.pdf
Recommendations
- The existence of a near-unanimity function is decidable
- The existence of a near-unanimity term in a finite algebra is decidable
- The undecidability of the semi-unification problem
- scientific article; zbMATH DE number 4031659
- scientific article; zbMATH DE number 176152
- Deciding the existence of quasiweak near unanimity terms in finite algebras
- The undecidability of the DA-unification problem
- scientific article; zbMATH DE number 4031661
- On the question of absolute undecidability
Structure theory of algebraic structures (08A05) Operations and polynomials in algebraic structures, primal algebras (08A40)
Cited In (15)
- Title not available (Why is that?)
- Finite degree clones are undecidable
- Finitely generated clones of terms
- Between an n-ary and an n + 1-ary near-unanimity term
- Decidability of absorption in relational structures of bounded width.
- Finitely related algebras in congruence distributive varieties have near unanimity terms
- Preserving near unanimity terms under products
- Deciding the existence of minority terms
- Existence of cube terms in finite algebras
- Title not available (Why is that?)
- Unequivocal majority and Maskin-monotonicity
- The existence of a near-unanimity term in a finite algebra is decidable
- Near-unanimity is decomposable
- A characterization of completeness of blockability relations with respect to unanimity
- The existence of a near-unanimity function is decidable
This page was built for publication: On the (un)decidability of a near-unanimity term
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474099)
