An approach to tame congruence theory via subtraces

DOI10.1007/BF01195379zbMath0791.08001MaRDI QIDQ1312169

Steven Seif, Joel D. Berman

Publication date: 4 July 1994

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

zbMATH Keywords

binary polynomialsunary polynomialstype setsubtracescore-finite algebraspretame quotientsprime quotient of congruencestame congruencetame quotientsvariety generated by a single algebra

Mathematics Subject Classification ID

Subalgebras, congruence relations (08A30) Structure theory of algebraic structures (08A05) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (3)

THE TYPE SET OF A VARIETY IS NOT COMPUTABLE ⋮ Minimal sets and varieties ⋮ The set of types of a finitely generated variety

Cites Work

• Finite fixed point algebras are subdiagonalisable
• Unary polynomials in algebras. I
• Principal congruences in N-permutable varieties
• Problems and results in tame congruence theory. A survey of the '88 Budapest workshop
• The set of types of a finitely generated variety
• \(E\)-minimal semigroups
• Topics in universal algebra
• FINDING TYPE SETS IS NP-HARD
• An Easy Way to Minimal Algebras

This page was built for publication: An approach to tame congruence theory via subtraces