Sacks forcing does not always produce a minimal upper bound

DOI10.1016/0001-8708(79)90024-0zbMath0434.03030OpenAlexW2077902580MaRDI QIDQ1139583

Fred G. Abramson

Publication date: 1979

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0001-8708(79)90024-0

zbMATH Keywords

forcingadmissible set theorydependent choicehyperdegrees

Mathematics Subject Classification ID

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

Related Items (3)

Inadmissible forcing ⋮ Sacks forcing sometimes needs help to produce a minimal upper bound ⋮ Forcing and reducibilities. III. Forcing in fragments of set theory

Cites Work

• Countable admissible ordinals and hyperdegrees
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• On the degrees less than 0'
• Infinitary logic and admissible sets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sacks forcing does not always produce a minimal upper bound