05.08.2013 Views

Survey 1979: Equational Logic - Department of Mathematics ...

Survey 1979: Equational Logic - Department of Mathematics ...

Survey 1979: Equational Logic - Department of Mathematics ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

30 EQUATIONAL LOGIC<br />

The theory Z 1 ^ 232 is not finitely based, for (we omit the pro<strong>of</strong>), every basis must<br />

contain equations essentially the same as<br />

V::kW<br />

B. J6nsson [223] found two finitely based equational theories <strong>of</strong> lattices whose meet<br />

is not finitely based (also found by K. Baker - unpublished, but see [354]). Whether<br />

there exist such theories <strong>of</strong> groups is unknown. There do exist such theories among<br />

"modal logics" but not among "intermediate logics" (W. J. Blok thesis).<br />

By the one-one correspondence between varieties and equational classes set up at<br />

the beginning <strong>of</strong> õ5, we could equally well have described A as the lattice <strong>of</strong> all<br />

varieties under reverse inclusion, and sometimes it is helpful to view A this way. (And<br />

sometimes A is taken to be ordered by (non-reversed) inclusion <strong>of</strong> varieties - we will<br />

not do this here.)<br />

It is <strong>of</strong> interest to know what the lattices A look like. It has become clear that<br />

they are very complicated, as we will see. Burris [74] and Je.ek [207] have proved<br />

that if the type (nt)tC T has some n t > 2 or if n t > 1 for two values <strong>of</strong> t, then A<br />

contains an infinite partition lattice, and hence obeys no special lattice laws at all.<br />

Thus, it has proved fruitful to proceed by studying some (<strong>of</strong>ten simpler) special<br />

sublattices <strong>of</strong> A, namely for fixed Z, the lattice A(Z) <strong>of</strong> all equational theories D-- Z.<br />

(Equivalently, as above, the lattice <strong>of</strong> all subvarieties <strong>of</strong> Mod Z.) There is only one 23<br />

with [A(Z)[ = 1, namely Z = {x = y}. Theories Z with [A(Z)[ = 2, i.e.<br />

A(E):<br />

are called equationally complete. Since every A is an algebraic closure system and<br />

{ x =y } is finitely based, every theory has an equationally complete extension, and<br />

ß<br />

thus the top <strong>of</strong> A consists wholly <strong>of</strong> replicas <strong>of</strong> the above picture. An algebra A is<br />

equationally complete iff Eq A is equationally complete. It has been determined that<br />

there exist many equationally complete theories (and algebras), in two senses. First,<br />

Kalicki proved [233] that in a type with one binary operation there exist 2 0 distinct<br />

equationally complete theories (and the corresponding number has been evaluated for

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!