On trees without hyperimmune branches
From MaRDI portal
Publication:2104272
DOI10.1007/978-3-031-08740-0_20OpenAlexW4285212373MaRDI QIDQ2104272
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08740-0_20
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomness for computable measures and initial segment complexity
- On degrees of recursive unsolvability
- Effective domination and the bounded jump
- On \(\Pi{}^ 0_ 1\) classes and their ranked points
- Classical recursion theory. The theory of functions and sets of natural numbers
- On the degrees less than 0'
- A criterion for completeness of degrees of unsolvability
- Schnorr trivial sets and truth-table reducibility
- Computability and Randomness
- The Degrees of Hyperimmune Sets
- ∏ 0 1 Classes and Degrees of Theories
- Computational aspects of the hyperimmune-free degrees
- A Theorem on Hypersimple Sets
- Recursively enumerable sets of positive integers and their decision problems
- An introduction to Kolmogorov complexity and its applications
