Survey 1979: Equational Logic - Department of Mathematics ...
Survey 1979: Equational Logic - Department of Mathematics ...
Survey 1979: Equational Logic - Department of Mathematics ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
40 EQUATIONAL LOGIC<br />
semilattices (co n = 2n-l), the variety <strong>of</strong> groups given by the law x 3= 1 (see e.g.<br />
[330] ), the variety <strong>of</strong> Heyting algebras defined by "Stone's identity" (see [ 189] ), and<br />
some varieties <strong>of</strong> interior algebras (W. J. Blok, thesis). The quasi-primal varieties <strong>of</strong><br />
Pixley et al. <strong>of</strong>ten have very easily calculated co (see e.g. [362] or [369] for<br />
quasi-primal varieties); see the chart on page 291 <strong>of</strong> [424] for some explicit<br />
calculations. (But in the eight line, 1 should be 0.)<br />
But for most common varieties, the invariant co(V) is either trivial (because<br />
infinite) or hopelessly complicated. Sometimes special cases can be calculated.<br />
Dedekind found in 1900 that the free modular lattice on 3 generators has 28 elements<br />
("free algebra" had not yet been defined) (see [50, page 631 ). For some other special<br />
calculations (distributive lattices, etc.), see [50, page 63], [437], [46] and [47].<br />
The class <strong>of</strong> all finite co(V) is closed under (co6rdinatewise) multiplication (see e.g.<br />
[424, 0.5(4), page 266]), and it forms a closed set in the space coco (S'wierczkowski -<br />
see [ 282, page 181 ] ).<br />
The famous Burnside Problem asked whether F v(n) is always finite for V the<br />
variety <strong>of</strong> groups defined by the law x TM = 1. The negative solution by Novikov and<br />
Adjan [335] stated that IFv(2)I-- q0 when e.g. m = 4381. The pro<strong>of</strong> in [66] is said<br />
to be false (see [3] ). (Now 4381 has been reduced to 665 [3] .) For related results in<br />
semigroups, see [ 171 ].<br />
In general algebra, a typical theorem is that <strong>of</strong> Ptonka [364]: if con(V) = n. 2 n-1 ,<br />
then V must be equivalent to one <strong>of</strong> four varieties, namely those given by 231 - 234:<br />
Zi: xx=x<br />
(xy)z = x(zy)<br />
x(yz) = x(zy)<br />
Z2: xx = x<br />
(xy)z = (xz)y<br />
x(yz) = xy<br />
(xy)y = xy<br />
233: xx = x<br />
(xy)z = (xz)y<br />
x(yz) = xy<br />
(xy)y = x