The upward closure of a perfect thin class

DOI10.1016/j.apal.2008.06.006zbMath1153.03018OpenAlexW2093856137MaRDI QIDQ958485

Noam Greenberg, Joseph S. Miller, Rodney G. Downey

Publication date: 5 December 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.06.006

zbMATH Keywords

algorithmic randomnessMuchnik degreesrandom realsthin \(\Pi_1^0\) classes

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

DEEP CLASSES

Cites Work

• Maximal theories
• Countable thin \(\Pi^0_1\) classes
• Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
• Algorithmic Randomness and Complexity
• Mass Problems and Randomness
• Calibrating Randomness
• Measure and minimal degrees
• Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
• An extension of the recursively enumerable Turing degrees
• Computability and Randomness
• Axiomatizable theories with few axiomatizable extensions
• ∏ 0 1 Classes and Degrees of Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The upward closure of a perfect thin class