The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences (Q1117961): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q354675
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Aldo Ursini / rank
 
Normal rank

Revision as of 19:12, 13 February 2024

scientific article
Language Label Description Also known as
English
The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences
scientific article

    Statements

    The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences (English)
    0 references
    0 references
    0 references
    1989
    0 references
    Let V be a locally finite, congruence permutable variety with equationally definable principal congruences and 1-regular (i.e. there is a constant 1 such that \(1/R=1/s\) implies \(R=S\) for any congruences R, S of any algebra in V). If there is a subdirectly irreducible algebra whose congruences do not form a chain, then the class of all finitely generated free algebras in V has a hereditarily undecidable first order theory. The proof is by interpreting in this class the class of all finite biparpite graphs with at least 3 elements.
    0 references
    0 references
    0 references
    0 references
    0 references
    congruence permutable variety
    0 references
    equationally definable principal congruences
    0 references
    hereditarily undecidable first order theory
    0 references
    finite biparpite graphs
    0 references
    0 references