Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy

DOI10.2307/2273224zbMath0483.03028OpenAlexW2000335901MaRDI QIDQ3941395

Harold T. Hodes

Publication date: 1981

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273224

zbMATH Keywords

jumpconstructible universeadmissible ordinalmaster-code

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items (1)

Finite level Borel games and a problem concerning the jump hierarchy

Cites Work

• Jumping through the transfinite: the master code hierarchy of Turing degrees

This page was built for publication: Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy