A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Boolean algebra of logic
1975
Bulletin of the American Mathematical Society
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 finitely axiomatizable theory. More complete details of the proof will appear in a forthcoming monograph by William Hanf, Dale Myers, and Roger Simons. This verifies Conjecture I of Hanf [2] that every axiomatizable theory is recursively isomorphic to a finitely axiomatizable theory. It solves a
doi:10.1090/s0002-9904-1975-13747-5
fatcat:a4n2fwtf7jeo7jvkx2im3fauoi