Reflection and forcing in E-recursion theory

Annals of Pure and Applied Logic 29 (1):79-106 (1985)
  Copy   BIBTEX

Abstract

E -recursive enumerability is compared via forcing to Σ 1 definability. It is shown that for every countable E -closed ordinal κ there is a set of reals, X, so that L κ [ X ] is the least E -closed structure over X.

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(85)90036-3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

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

More on simple forcing notions and forcings with ideals.M. Gitik & S. Shelah - 1993 - Annals of Pure and Applied Logic 59 (3):219-238.
Destructibility of stationary subsets of Pκλ.Sakaé Fuchino & Greg Piper - 2005 - Mathematical Logic Quarterly 51 (6):560-569.
Needed reals and recursion in generic reals.Andreas Blass - 2001 - Annals of Pure and Applied Logic 109 (1-2):77-88.
Selected logic papers.Gerald E. Sacks - 1999 - River Edge, N.J.: World Scientific.
Effective forcing versus proper forcing.Gerald E. Sacks - 1996 - Annals of Pure and Applied Logic 81 (1-3):171-185.
Forcing closed unbounded subsets of ω2.M. C. Stanley - 2001 - Annals of Pure and Applied Logic 110 (1-3):23-87.
On closed unbounded sets consisting of former regulars.Moti Gitik - 1999 - Journal of Symbolic Logic 64 (1):1-12.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Indestructibility and stationary reflection.Arthur W. Apter - 2009 - Mathematical Logic Quarterly 55 (3):228-236.
Partial near supercompactness.Jason Aaron Schanker - 2013 - Annals of Pure and Applied Logic 164 (2):67-85.

Analytics

Added to PP
2013-10-30

Downloads
26 (#599,290)

6 months
11 (#339,290)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Another extension of Van de Wiele's theorem.Robert S. Lubarsky - 1988 - Annals of Pure and Applied Logic 38 (3):301-306.
The limits of E-recursive enumerability.Gerald E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87-120.
The limits of "E"-recursive enumerability.G. E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87.

Add more citations

References found in this work

Recursive Functionals and Quantifiers of Finite Types II.S. C. Kleene - 1971 - Journal of Symbolic Logic 36 (1):146-146.
Recursive Functionals and Quantifiers of Finite Types I.A. Nerode - 1962 - Journal of Symbolic Logic 27 (1):82-83.
Hyperanalytic Predicates.Yiannis N. Moschovakis & Thomas J. Grilliot - 1971 - Journal of Symbolic Logic 36 (1):147-148.

Add more references