The set of types of a finitely generated variety

DOI10.1016/0012-365X(93)90219-JzbMath0782.08002OpenAlexW1970707058MaRDI QIDQ1210548

Joel D. Berman, Emil W. Kiss, Peter Pröhle, Ágnes Szendrei

Publication date: 30 August 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90219-j

zbMATH Keywords

polynomial-time algorithmsubtracestype set of a finite algebraic system

Mathematics Subject Classification ID

Structure theory of algebraic structures (08A05) Varieties (08B99)

Related Items (5)

THE TYPE SET OF A VARIETY IS NOT COMPUTABLE ⋮ Computers and universal algebra: Some directions ⋮ OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT ⋮ Recent Results on the Algebraic Approach to the CSP ⋮ An approach to tame congruence theory via subtraces

Cites Work

• Unnamed Item
• Unary polynomials in algebras. I
• Free lattices in some small varieties
• Problems and results in tame congruence theory. A survey of the '88 Budapest workshop
• An approach to tame congruence theory via subtraces
• A maximal clone of monotone operations which is not finitely generated
• Type Preservation In Locally Finite Varieties with the CEP
• The structure of finite algebras

This page was built for publication: The set of types of a finitely generated variety