The combinatorics of combinatorial coding by a real

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


We lay the combinatorial foundations for [5] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals



    Upload a copy of this work     Papers currently archived: 89,446

External links

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

Through your library


Added to PP

23 (#576,041)

6 months
1 (#1,005,371)

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

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Some applications of Jensen's coding theorem.R. David - 1982 - Annals of Mathematical Logic 22 (2):177-196.
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.

Add more references