Lattices of c-degrees (Q1095901): Difference between revisions

The question of the possible (consistent with ZFC or ZF) shapes of the upper semi-lattice of constructibility degrees is considered. The author fixes his attention on possible countable lattices of c-degrees in models of ZFC. The main theorem gives a restriction on the possibility of realizing a countable lattice as the lattice of c-degrees. Namely, it is proved that if a countable lattice is the lattice of c-degrees then it is complete. The theorem is very interesting by the fact that it is a negative result. Combined with the positive result that every well- founded constructible lattice can be realized as the lattice of c- degrees, it is an important step toward characterizing the possible orders of c-degrees. It is also interesting by the fact that it distinguishes c-degrees from Turing degrees. Besides the main theorem there are a few interesting counterexamples to the theorem under weakened assumptions, e.g., where the countability assumption about the lattice is dropped or where ZFC is replaced by ZF.