Forcing and reductibilities. II. Forcing in fragments of analysis

DOI10.2307/2273465zbMath0574.03024OpenAlexW2039493583MaRDI QIDQ3691651

Piergiorgio Odifreddi

Publication date: 1983

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

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

zbMATH Keywords

hyperarithmetical setsSacks forcinghyperdegreesFeferman forcingpi-one-one sets

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (1)

Lattice initial segments of the hyperdegrees

Cites Work

• Unnamed Item
• First-order theory of the degrees of recursive unsolvability
• On the reducibility of \(\Pi_ 1^ 1\) sets
• Hierarchies of number-theoretic predicates
• Degrees joining to 0′
• On homogeneity and definability in the first-order theory of the Turing degrees
• Jumping through the transfinite: the master code hierarchy of Turing degrees
• Reducibility orderings: Theories, definability and automorphisms
• Transfinite extensions of Friedberg's completeness criterion
• The homogeneity conjecture
• Some applications of forcing to hierarchy problems in arithmetic

This page was built for publication: Forcing and reductibilities. II. Forcing in fragments of analysis