Grigorieff Forcing on Uncountable Cardinals Does Not Add a Generic of Minimal Degree

Notre Dame Journal of Formal Logic 50 (2):195-200 (2009)
  Copy   BIBTEX

Abstract

Grigorieff showed that forcing to add a subset of ω using partial functions with suitably chosen domains can add a generic real of minimal degree. We show that forcing with partial functions to add a subset of an uncountable κ without adding a real never adds a generic of minimal degree. This is in contrast to forcing using branching conditions, as shown by Brown and Groszek

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Uncountable superperfect forcing and minimality.Elizabeth Theta Brown & Marcia J. Groszek - 2006 - Annals of Pure and Applied Logic 144 (1-3):73-82.
A Lifting Argument for the Generalized Grigorieff Forcing.Radek Honzík & Jonathan Verner - 2016 - Notre Dame Journal of Formal Logic 57 (2):221-231.
Arithmetical Sacks Forcing.Rod Downey & Liang Yu - 2006 - Archive for Mathematical Logic 45 (6):715-720.
Cohen forcing and inner models.Jonas Reitz - 2020 - Mathematical Logic Quarterly 66 (1):65-72.
Indestructibility of the tree property.Radek Honzik & Šárka Stejskalová - 2020 - Journal of Symbolic Logic 85 (1):467-485.
Unfoldable cardinals and the GCH.Joel Hamkins - 2001 - Journal of Symbolic Logic 66 (3):1186-1198.
The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
A version of $$kappa $$ κ -Miller forcing.Heike Mildenberger & Saharon Shelah - 2020 - Archive for Mathematical Logic 59 (7-8):879-892.

Analytics

Added to PP
2013-11-02

Downloads
25 (#884,004)

6 months
13 (#264,153)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Lifting Argument for the Generalized Grigorieff Forcing.Radek Honzík & Jonathan Verner - 2016 - Notre Dame Journal of Formal Logic 57 (2):221-231.

Add more citations

References found in this work

Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Uncountable superperfect forcing and minimality.Elizabeth Theta Brown & Marcia J. Groszek - 2006 - Annals of Pure and Applied Logic 144 (1-3):73-82.
Combinatorics on ideals and forcing.Serge Grigorieff - 1971 - Annals of Mathematical Logic 3 (4):363.

Add more references