PA RELATIVE TO AN ENUMERATION ORACLE
From MaRDI portal
Publication:6180605
DOI10.1017/jsl.2022.55OpenAlexW4285726452MaRDI QIDQ6180605
Joseph S. Miller, Iskander Sh. Kalimullin, Jun Le Goh, Mariya Ivanova Soskova
Publication date: 22 December 2023
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2022.55
Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Martin-Löf randomness and Galton-Watson processes
- Recursion theory week. Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984
- Enumeration 1-genericity in the local enumeration degrees
- Density of the cototal enumeration degrees
- Characterizing the continuous degrees
- An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Reducibility and Completeness for Sets of Integers
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
- Cototal enumeration degrees and their applications to effective mathematics
- On cototality and the skip operator in the enumeration degrees
- A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES
- Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra
- Measures and their random reals
- Degrees of unsolvability of continuous functions
- Algorithmic Randomness of Closed Sets
- Arithmetical Reducibilities I
- ∏ 0 1 Classes and Degrees of Theories
- Defining totality in the enumeration degrees
- Creative sets
This page was built for publication: PA RELATIVE TO AN ENUMERATION ORACLE
