The Sacks density theorem and Σ2-bounding

Journal of Symbolic Logic 61 (2):450 - 467 (1996)
  Copy   BIBTEX

Abstract

The Sacks Density Theorem [7] states that the Turing degrees of the recursively enumerable sets are dense. We show that the Density Theorem holds in every model of P - + BΣ 2 . The proof has two components: a lemma that in any model of P - + BΣ 2 , if B is recursively enumerable and incomplete then IΣ 1 holds relative to B and an adaptation of Shore's [9] blocking technique in α-recursion theory to models of arithmetic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

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

Analytics

Added to PP
2009-01-28

Downloads
28 (#487,591)

6 months
4 (#315,908)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

∑2-constructions and I∑1.Marcia Groszek & Tamara Hummel - 1998 - Annals of Pure and Applied Logic 93 (1-3):83-101.
∑2-constructions and I∑1.Marcia Groszek & Tamara Hummel - 1998 - Annals of Pure and Applied Logic 93 (1-3):83-101.
Coding a family of sets.J. F. Knight - 1998 - Annals of Pure and Applied Logic 94 (1-3):127-142.
∑2-constructions and I∑1.Marcia Groszek & Tamara Hummel - 1998 - Annals of Pure and Applied Logic 93 (1-3):83-101.

Add more citations

References found in this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.
The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
The recursively enumerable alpha-degrees are dense.Richard A. Shore - 1976 - Annals of Mathematical Logic 9 (1/2):123.

View all 6 references / Add more references