Lattices of c-degrees (Q1095901): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4147977 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Initial segments of the degrees of size \(\aleph _ 1\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distributive Initial Segments of the Degrees of Unsolvability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Countable initial segments of the degrees of unsolvability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Initial segments of the degrees of unsolvability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3329452 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5632568 / rank | |||
Normal rank |
Latest revision as of 13:42, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lattices of c-degrees |
scientific article |
Statements
Lattices of c-degrees (English)
0 references
1987
0 references
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.
0 references
degrees of constructibility
0 references
upper semi-lattice
0 references
countable lattices of c- degrees in models of ZFC
0 references
counterexamples
0 references