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
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Aldo Ursini / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of varieties with equationally definable principal congruences. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of varieties with equationally definable principal congruences. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and Boolean representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-theoretic decision problems in universal algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete and model-complete theories of monadic algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of Brouwerian semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability problem for finite Heyting algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of free pseudo-complemented semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of relatively free Hilbert algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras Whose Congruence Lattices are Distributive. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties with equationally definable principal congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prevarieties of associative rings whose elementary theory is decidable / rank
 
Normal rank

Latest revision as of 14:42, 19 June 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