- On relative randomness.Antonín Kučera - 1993 - Annals of Pure and Applied Logic 63 (1):61-67.details
|
|
Calibrating randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.details
|
|
(1 other version)Σ5-completeness of index sets arising from the recursively enumerable Turing degrees.Michael A. Jahn - 1996 - Annals of Pure and Applied Logic 79 (2):109-137.details
|
|
(1 other version)< i> Σ_< sub> 5-completeness of index sets arising from the recursively enumerable Turing degrees.Michael A. Jahn - 1996 - Annals of Pure and Applied Logic 79 (2):109-137.details
|
|
∑5-completeness of index sets arising from the lattice of recursively enumerable sets.Michael A. Jahn - 1996 - Annals of Pure and Applied Logic 80 (1):55-67.details
|
|
Immunity and Hyperimmunity for Sets of Minimal Indices.Frank Stephan & Jason Teutsch - 2008 - Notre Dame Journal of Formal Logic 49 (2):107-125.details
|
|
The d.r.e. degrees are not dense.S. Cooper, Leo Harrington, Alistair Lachlan, Steffen Lempp & Robert Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.details
|
|
The d.r.e. degrees are not dense.S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.details
|
|
A survey of Mučnik and Medvedev degrees.Peter G. Hinman - 2012 - Bulletin of Symbolic Logic 18 (2):161-229.details
|
|
On diagonal functions for equivalence relations.Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev & Manat Mustafa - 2023 - Archive for Mathematical Logic 63 (3):259-278.details
|
|
Open questions about Ramsey-type statements in reverse mathematics.Ludovic Patey - 2016 - Bulletin of Symbolic Logic 22 (2):151-169.details
|
|
On the Turing degrees of minimal index sets.Jason Teutsch - 2007 - Annals of Pure and Applied Logic 148 (1):63-80.details
|
|
The noneffectivity of Arslanov’s completeness criterion and related theorems.Sebastiaan A. Terwijn - 2020 - Archive for Mathematical Logic 59 (5-6):703-713.details
|
|
Coding true arithmetic in the Medvedev degrees of classes.Paul Shafer - 2012 - Annals of Pure and Applied Logic 163 (3):321-337.details
|
|
Ramsey-type graph coloring and diagonal non-computability.Ludovic Patey - 2015 - Archive for Mathematical Logic 54 (7-8):899-914.details
|
|
Extending and interpreting Post’s programme.S. Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.details
|
|
Lowness for isomorphism, countable ideals, and computable traceability.Johanna N. Y. Franklin & Reed Solomon - 2020 - Mathematical Logic Quarterly 66 (1):104-114.details
|
|
Quasi‐completeness and functions without fixed‐points.Ilnur I. Batyrshin - 2006 - Mathematical Logic Quarterly 52 (6):595-601.details
|
|
Fixed point theorems for precomplete numberings.Henk Barendregt & Sebastiaan A. Terwijn - 2019 - Annals of Pure and Applied Logic 170 (10):1151-1161.details
|
|
Extending and interpreting Post’s programme.S. Barry Cooper - 2010 - Annals of Pure and Applied Logic 161 (6):775-788.details
|
|