The set of types of a finitely generated variety
type: Item
instance of: scholarly article
title: The set of types of a finitely generated variety
zbMATH Open document ID: 0782.08002
DOI: 10.1016/0012-365X(93)90219-J
author: Joel Berman
author: Emil W. Kiss
author: Peter Pröhle
author: Ágnes Szendrei
published in: Discrete Mathematics
publication date: 1993-08-30T00:00:00Z
Mathematics Subject Classification ID: 08A05
Mathematics Subject Classification ID: 08B99
zbMATH DE Number: 179584
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: type set of a finite algebraic system
zbMATH Keywords: subtraces
MaRDI profile type: Publication
cites work: Q4091421
cites work: An approach to tame congruence theory via subtraces
cites work: Free lattices in some small varieties
cites work: The structure of finite algebras
cites work: Type Preservation In Locally Finite Varieties with the CEP
cites work: Problems and results in tame congruence theory. A survey of the '88 Budapest workshop
cites work: Unary polynomials in algebras. I
cites work: A maximal clone of monotone operations which is not finitely generated
full work available at URL: 0012-365x(93)90219-j
OpenAlex ID: W1970707058
Recommended article: Q4438090
Recommended article: Varieties generated by completions
Recommended article: Varieties whose finitely generated members are free
Recommended article: Varieties generated by finite homogeneous algebras
Recommended article: Q5483295
Recommended article: Varieties generated by free algebras of type (-1,1) of finite rank
Recommended article: Finitely generated permutative varieties.
Recommended article: Families of varieties of general type over compact bases
Recommended article: Q4860560
Recommended article: Q4316182
description: scientific article; zbMATH DE number 179584