A simpler proof of Jensen's coding theorem

Abstract

Jensen's remarkable Coding Theorem asserts that the universe can be included in L[R] for some real R, via class forcing. The purpose of this article is to present a simpler proof of Jensen's theorem, obtained by implementing some changes first developed for the theory of Strong Coding. In particular, our proof avoids the split into cases, according to whether or not 0# exists in the ground model

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,660

External links

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

Through your library

Analytics

Added to PP
2014-01-16

Downloads
15 (#703,766)

6 months
1 (#388,311)

Historical graph of downloads
How can I increase my downloads?

Similar books and articles

Some Applications of Jensen's Coding Theorem.R. David - 1982 - Annals of Mathematical Logic 22 (2):177-196.
A Note on Hjorth's Oscillation Theorem.Julien Melleray - 2010 - Journal of Symbolic Logic 75 (4):1359-1365.
Blunt and Topless End Extensions of Models of Set Theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Gleason's Theorem has a Constructive Proof.Fred Richman - 2000 - Journal of Philosophical Logic 29 (4):425-431.
Tait's Conservative Extension Theorem Revisited.Ryota Akiyoshi - 2010 - Journal of Symbolic Logic 75 (1):155-167.
A Guide to "Coding the Universe" by Beller, Jensen, Welch.Sy D. Friedman - 1985 - Journal of Symbolic Logic 50 (4):1002-1019.

Author's Profile

References found in this work

The Fine Structure of the Constructible Hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Jensen's Σ* Theory and the Combinatorial Content of V = L.Sy D. Friedman - 1994 - Journal of Symbolic Logic 59 (3):1096 - 1104.
Strong Coding.Sy D. Friedman - 1987 - Annals of Pure and Applied Logic 35 (3):1-98.

Add more references

Citations of this work

Coding Without Fine Structure.Sy D. Friedman - 1997 - Journal of Symbolic Logic 62 (3):808-815.

Add more citations