Uncountable master codes and the jump hierarchy

DOI10.2307/2273829MaRDI QIDQ3775547zbMATH OpenOpenAlexFDO

Authors 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

forcinghierarchy of subsetsJensen's master codesjump hierarchyregular cardinaltransfinite Turing jumps

Mathematics Subject Classification ID

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

Recommendations

• Turing jumps in the Ershov hierarchy
• scientific article; zbMATH DE number 2204762
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• scientific article; zbMATH DE number 5504384
• On the notion of jump structure

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775547)