Forcing and reducibilities. III. Forcing in fragments of set theory

DOI10.2307/2273666zbMath0574.03025OpenAlexW2142553648MaRDI QIDQ3691652

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/2273666

zbMATH Keywords

hyperdegreesL-degreesforcing with trees on admissible sets

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other aspects of forcing and Boolean-valued models (03E40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

On the First Order Theory of the Arithmetical Degrees

Cites Work

• Unnamed Item
• Descriptive set theory
• Sacks forcing does not always produce a minimal upper bound
• On the reducibility of \(\Pi_ 1^ 1\) sets
• On Sequences of Degrees of Constructibility (Solution of Friedman'S Problem 75)
• Forcing with tagged trees
• Constructive transfinite number classes
• A complete classification of the Δ₂¹-functions
• Degrees of unsolvability of constructible sets of integers
• Some applications of model theory in set theory
• The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis

This page was built for publication: Forcing and reducibilities. III. Forcing in fragments of set theory