Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties
type: Item
instance of: scholarly article
title: Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties
zbMATH Open document ID: 0671.03004
DOI: 10.1007/BF01229982
author: Paweł M. Idziak
published in: Algebra Universalis
publication date: 1988-01-01T00:00:00Z
review text: The main result of the paper is the following: The first order theory of the class of all finite algebras in a finitely generated arithmetical variety of finite type in which all subdirectly irreducible algebras have linearly ordered congruences, is decidable. The proof is based on a representation of finite algebras from such varieties by some quotients of special subdirect products in which sets of indices are partially ordered in dual trees.
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03C05
Mathematics Subject Classification ID: 03C30
zbMATH DE Number: 4097335
zbMATH Keywords: reduced sub-powers
zbMATH Keywords: finite algebras
zbMATH Keywords: finitely generated arithmetical variety
zbMATH Keywords: subdirect products
MaRDI profile type: Publication
cites work: Decidability and Boolean representations
cites work: Sheaf Constructions and Their Elementary Properties
cites work: Complete and model-complete theories of monadic algebras
cites work: Undecidability of Brouwerian semilattices
cites work: Decidability problem for finite Heyting algebras
cites work: Q3801521
cites work: Undecidability of free pseudo-complemented semilattices
cites work: Undecidability of relatively free Hilbert algebras
cites work: Q3470450
cites work: Q3976917
cites work: Algebras Whose Congruence Lattices are Distributive.
cites work: Global subdirect products
cites work: The structure of decidable locally finite varieties
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q5181410
cites work: Q4128808
cites work: Prevarieties of associative rings whose elementary theory is decidable
full work available at URL: https://doi.org/10.1007/bf01229982
OpenAlex ID: W2033603815
Recommended article: The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences
Recommended article: Reduction Numbers and Rees Algebras of Powers of an Ideal
Recommended article: Varieties with few subalgebras of powers
Recommended article: Q4203359
Recommended article: Finite subschemes of abelian varieties and the Schottky problem
Recommended article: Q3691799
Recommended article: Type 2 subdirectly irreducible algebras in finitely decidable varieties
Recommended article: Algebraic compactness of reduced powers over commutative perfect rings
Recommended article: Sous–variétés algébriques de variétés semi–abéliennes sur un corps fini
Recommended article: On the Subalgebras of Finite Division Algebras
description: scientific article; zbMATH DE number 4097335