Pages that link to "Item:Q3489987"
From MaRDI portal
The following pages link to Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion (Q3489987):
Displayed 25 items.
- Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes (Q409326) (← links)
- Fractal dimension versus process complexity (Q504699) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- On relative randomness (Q688792) (← links)
- The noneffectivity of Arslanov's completeness criterion and related theorems (Q781514) (← links)
- Ramsey-type graph coloring and diagonal non-computability (Q892143) (← links)
- The d.r.e. degrees are not dense (Q1182487) (← links)
- \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees (Q1919542) (← links)
- \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets (Q1919553) (← links)
- Fixed-point selection functions (Q2030128) (← links)
- Precomplete numberings (Q2036469) (← links)
- Things that can be made into themselves (Q2252527) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- On the Turing degrees of minimal index sets (Q2382278) (← links)
- Diagonally Non-Computable Functions and Bi-Immunity (Q2869911) (← links)
- A Survey of Mučnik and Medvedev Degrees (Q2893281) (← links)
- Three Theorems on n-REA Degrees: Proof-Readers and Verifiers (Q3091436) (← links)
- Calibrating Randomness (Q3412463) (← links)
- Ramsey's theorem and cone avoidance (Q3630579) (← links)
- Hyperarithmetical Index Sets in Recursion Theory (Q3797173) (← links)
- GENERALIZATIONS OF THE RECURSION THEOREM (Q4647121) (← links)
- Fixpoints and relative precompleteness (Q5075519) (← links)
- Lowness for isomorphism, countable ideals, and computable traceability (Q5112396) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
- Randomness, relativization and Turing degrees (Q5718673) (← links)