The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences

DOI10.1007/BF01243871zbMath0668.08008MaRDI QIDQ1117961

Paweł M. Idziak

Publication date: 1989

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

zbMATH Keywords

congruence permutable variety; equationally definable principal congruences; finite biparpite graphs; hereditarily undecidable first order theory

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

08B20: Free algebras

08B99: Varieties

Related Items

Varieties with decidable finite algebras. I: Linearity, Bjarni Jónsson's contributions in algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of varieties with equationally definable principal congruences. II
• Undecidability of free pseudo-complemented semilattices
• Undecidability of relatively free Hilbert algebras
• Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties
• Prevarieties of associative rings whose elementary theory is decidable
• Varieties with equationally definable principal congruences
• Lattice-theoretic decision problems in universal algebra
• Undecidability of Brouwerian semilattices
• On the structure of varieties with equationally definable principal congruences. I
• Decidability problem for finite Heyting algebras
• Decidability and Boolean representations
• Complete and model-complete theories of monadic algebras
• Algebras Whose Congruence Lattices are Distributive.