A combinatorial forcing for coding the universe by a real when there are no sharps
Journal of Symbolic Logic 60 (1):1-35 (1995)
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 itselfDOI
10.2307/2275507
My notes
Similar books and articles
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Combinatorial properties of filters and open covers for sets of real numbers.Claude Laflamme & Marion Scheepers - 1999 - Journal of Symbolic Logic 64 (3):1243-1260.
Forcing many positive polarized partition relations between a cardinal and its powerset.Saharon Shelah & Lee J. Stanley - 2001 - Journal of Symbolic Logic 66 (3):1359-1370.
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.
What is the operating point? A discourse on perceptual organisation.Simon R. Schultz - 2000 - Behavioral and Brain Sciences 23 (4):491-492.
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.
The combinatorics of combinatorial coding by a real.Saharon Shelah & Lee J. Stanley - 1995 - Journal of Symbolic Logic 60 (1):36-57.
Analytics
Added to PP
2009-01-28
Downloads
32 (#367,412)
6 months
2 (#300,121)
2009-01-28
Downloads
32 (#367,412)
6 months
2 (#300,121)
Historical graph of downloads
References found in this work
Some applications of Jensen's coding theorem.R. David - 1982 - Annals of Mathematical Logic 22 (2):177-196.