A combinatorial forcing for coding the universe by a real when there are no sharps

Journal of Symbolic Logic 60 (1):1-35 (1995)
  Copy   BIBTEX

Abstract

Assuming 0 ♯ does not exist, we present a combinatorial approach to Jensen's method of coding by a real. The forcing uses combinatorial consequences of fine structure (including the Covering Lemma, in various guises), but makes no direct appeal to fine structure itself

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,297

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.
Forcing with stable posets.Uri Avraham & Saharon Shelah - 1982 - Journal of Symbolic Logic 47 (1):37-42.
Backwards Easton forcing and 0#. [REVIEW]M. C. Stanley - 1988 - Journal of Symbolic Logic 53 (3):809 - 833.
Forcing the failure of ch by adding a real.Saharon Shelah & Hugh Woodin - 1984 - Journal of Symbolic Logic 49 (4):1185-1189.
On the theoretical role of "genetic coding".Peter Godfrey-Smith - 2000 - Philosophy of Science 67 (1):26-44.

Analytics

Added to PP
2009-01-28

Downloads
32 (#367,193)

6 months
2 (#298,943)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Some applications of Jensen's coding theorem.R. David - 1982 - Annals of Mathematical Logic 22 (2):177-196.
Cardinal Arithmetic.Saharon Shelah - 1998 - Studia Logica 60 (3):443-448.
Minimal Coding.Sy D. Friedman - 1989 - Annals of Pure and Applied Logic 41 (3):233-297.
A guide to “strong coding”.Sy D. Friedman - 1987 - Annals of Pure and Applied Logic 35 (C):99-122.
Annals of Pure and Applied Logic. [REVIEW]Sy D. Friedman - 2001 - Bulletin of Symbolic Logic 7 (4):538-539.

View all 7 references / Add more references