A finitely based theory of a non-trivial language,with exactly ℵ0 subcovers

LetL=f, g be the language with two unary operation symbols. I prove that the finitely based equational theory =[f₀=₀] ofL covers exactly ₀ others.Presented by S. Burris.Dedicated to George McNulty, my mentor in equational logic.