 Effectiveness. Finitely based theories can be effectively enumerated. That is, given a finite set \(A\) of equations, one can write a computer program that prints consequences of \(A\) for ever in such a way that every consequence of \(A\) will appear at some finite position in the infinite list of all consequences. The same conclusion obtains when we weaken the requirement that \(A\) be finite to merely that it can be effectively enumerated. That is, if the axiomatization is effectively enumerable so is its deductive closure.