Compactness arguments with effectively closed sets for the study of relative randomness
In the paper under review, the author presents a variety of compactness arguments with \(\Pi^0_1\)-classes which yield results about relative randomness, and in particular properties of the LR-degrees. The methods in the paper can be viewed as a twist of forcing arguments. The role of compactness is to make sure the existence of ``generic reals. NEWLINENEWLINENEWLINE It should be pointed out that Question 2.5 has been negatively answered by the reviewer. Question 3.6 was also negatively answered by a bunch of most recent results due to Day, Miller and others. Theorem 4.1 can also be obtained by applying the result, which is due to the author and Lewis, that there is a perfect \(\Pi^0_1\)-class in which every real is LR-below \(\emptyset'\).
- On the gap between trivial and nontrivial initial segment prefix-free complexity
- Randomness, lowness and degrees
- DEFINABLE MINIMAL COLLAPSE FUNCTIONS AT ARBITRARY PROJECTIVE LEVELS
- Incompleteness, approximation and relative randomness
- scientific article; zbMATH DE number 7311154 (Why is no real title available?)
- The importance of \(\Pi^0_1\) classes in effective randomness
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees
This page was built for publication: Compactness arguments with effectively closed sets for the study of relative randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907048)
