2000 character limit reached
Strong solvability and residual finiteness for finitely decidable varieties (1311.2683v1)
Published 12 Nov 2013 in math.LO
Abstract: If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result generalizes known results which assumed that V has modular congruence lattices. Our proof of the theorem in its full generality proceeds by showing that strongly solvable radicals of algebras in V are strongly abelian.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.