Uncountable master codes and the jump hierarchy

DOI10.2307/2273829zbMath0636.03043OpenAlexW2013426747MaRDI QIDQ3775547

Robert S. Lubarsky

Publication date: 1987

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

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

zbMATH Keywords

forcingregular cardinaljump hierarchyhierarchy of subsetsJensen's master codestransfinite Turing jumps

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Uncountable admissibles. II: Compactness
• Negative solutions to Post's problem. II
• Aspects of constructibility
• A degree-theoretic definition of the ramified analytical hierarchy
• Forcing with tagged trees
• Gaps in the contructable universe
• Degrees of unsolvability of constructible sets of integers

This page was built for publication: Uncountable master codes and the jump hierarchy