Arithmetical Sacks Forcing

&
Archive for Mathematical Logic 45 (6):715-720 (2006)
  Copy   BIBTEX

Abstract

We answer a question of Jockusch by constructing a hyperimmune-free minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical Sacks forcing. Some other applications are presented

Categories

Keywords

Reprint years

DOI

10.1007/s00153-006-0004-4

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

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

Through your library

My notes

Similar books and articles

Projective absoluteness for Sacks forcing.Daisuke Ikegami - 2009 - Archive for Mathematical Logic 48 (7):679-690.
Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
Grigorieff Forcing on Uncountable Cardinals Does Not Add a Generic of Minimal Degree.Brooke M. Andersen & Marcia J. Groszek - 2009 - Notre Dame Journal of Formal Logic 50 (2):195-200.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Effective forcing versus proper forcing.Gerald E. Sacks - 1996 - Annals of Pure and Applied Logic 81 (1-3):171-185.
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Forcing minimal degree of constructibility.Haim Judah & Saharon Shelah - 1991 - Journal of Symbolic Logic 56 (3):769-782.
More forcing notions imply diamond.Andrzej Rosłanowski & Saharon Shelah - 1996 - Archive for Mathematical Logic 35 (5-6):299-313.
Sacks forcing sometimes needs help to produce a minimal upper bound.Robert S. Lubarsky - 1989 - Journal of Symbolic Logic 54 (2):490-498.
Ultrafilters of Character $omega_1$.Klaas Pieter Hart - 1989 - Journal of Symbolic Logic 54 (1):1-15.
The covering number and the uniformity of the ideal ℐf.Noboru Osuga - 2006 - Mathematical Logic Quarterly 52 (4):351-358.
On non-wellfounded iterations of the perfect set forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
Essential Forcing Generics.Stephanie Cawthorne & David Kueker - 2000 - Notre Dame Journal of Formal Logic 41 (1):41-52.
Cardinal Invariants and the Collapse of the Continuum by Sacks Forcing.Miroslav Repický - 2008 - Journal of Symbolic Logic 73 (2):711 - 727.

Analytics

Added to PP
2013-11-23

Downloads
33 (#473,861)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A weakly 2-generic which Bounds a minimal degree.Rodney G. Downey & Satyadev Nandakumar - 2019 - Journal of Symbolic Logic 84 (4):1326-1347.

Add more citations

References found in this work

[Omnibus Review].M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.
The degrees below a 1-generic degree $.Christine Ann Haught - 1986 - Journal of Symbolic Logic 51 (3):770 - 777.
On $\Pi^0_1$ classes and their ranked points.Rod Downey - 1991 - Notre Dame Journal of Formal Logic 32 (4):499-512.
Minimal degrees recursive in 1-generic degrees.C. T. Chong & R. G. Downey - 1990 - Annals of Pure and Applied Logic 48 (3):215-225.

View all 7 references / Add more references