Testing for edge terms is decidable

DOI10.1007/s00012-015-0325-4zbMath1346.08001OpenAlexW1992139729MaRDI QIDQ2351513

Jonah Horowitz

Publication date: 23 June 2015

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

Full work available at URL: https://doi.org/10.1007/s00012-015-0325-4

Mathematics Subject Classification ID

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

Cites Work

• Finitely related clones and algebras with cube terms.
• Existence theorems for weakly symmetric operations
• A new tractable class of constraint satisfaction problems
• Decidability of absorption in relational structures of bounded width.
• Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• The existence of a near-unanimity term in a finite algebra is decidable
• Varieties with few subalgebras of powers
• The structure of finite algebras
• The shape of congruence lattices

This page was built for publication: Testing for edge terms is decidable