Learn More
A general method of constructing finitely axiomatizable theories is sketched. It is shown that every recursively enumerable Boolean algebra is isomorphic to the Boolean algebra of sentences of some(More)