Some minimal pairs of α-recursively enumerable degrees
From MaRDI portal
Publication:5677473
DOI10.1016/0003-4843(72)90007-1zbMath0262.02040MaRDI QIDQ5677473
Gerald E. Sacks, Manuel Lerman
Publication date: 1972
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(72)90007-1
03D30: Other degrees and reducibilities in computability and recursion theory
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Least upper bounds for minimal pairs of α-R.E. α-degrees, THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES, Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory, The irregular and non-hyperregular \(\alpha\)-r.e. degrees, The Role of True Finiteness in the Admissible Recursively Enumerable Degrees, Hyperhypersimple supersets in admissible recursion theory, An extension of the nondiamond theorem in classical and α-recursion theory, On the embedding of α-recursive presentable lattices into the α-recursive degrees below 0′, One hundred and two problems in mathematical logic, On minimal pairs and minimal degrees in higher recursion theory, Inadmissible recursion theory