Small \(\Pi^{0}_{1}\) classes
From MaRDI portal
Publication:2491076
DOI10.1007/s00153-005-0319-6zbMath1147.03024OpenAlexW150151532MaRDI QIDQ2491076
Publication date: 26 May 2006
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-005-0319-6
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Effectively closed sets and enumerations, On effectively closed sets of effective strong measure zero, Medvedev degrees of two-dimensional subshifts of finite type, Immunity for Closed Sets, Mass problems associated with effectively closed sets, Unified characterizations of lowness properties via Kolmogorov complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embeddings into the Medvedev and Muchnik lattices of \(\Pi^0_1\) classes
- Classical recursion theory. Vol. II
- Density of the Medvedev lattice of \(\Pi^0_1\) classes
- A stronger form of a theorem of Friedberg
- Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees
- A splitting theorem for the Medvedev and Muchnik lattices
- On the Lattice of Recursively Enumerable Sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Simplicity of recursively enumerable sets
- ∏ 0 1 Classes and Degrees of Theories
- Recursively enumerable sets of positive integers and their decision problems
