395 research outputs found

    Principal and syntactic congruences in congruence-distributive and congruence-permutable varieties

    Get PDF
    We give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or, equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very finite

    Dualizability of automatic algebras

    Full text link
    We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra is dualizable if its letters act as an abelian group of permutations on its states. To illustrate the potential difficulty of the general problem, we exhibit an infinite ascending chain A1≤A2≤A3≤...b\mathbf A_1 \le \mathbf A_2 \le \mathbf A_3 \le ...b of finite automatic algebras that are alternately dualizable and non-dualizable

    The dualisability of a quasi-variety is independent of the generating algebra

    Full text link
    • …
    corecore