The combinatorics of combinatorial coding by a real

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

Abstract

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

Links

PhilArchive



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

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

Codings and strongly inaccessible cardinals.Tadatoshi Miyamoto - 2017 - Archive for Mathematical Logic 56 (7-8):1037-1044.
Coding lemmata in L.George Kafkoulis - 2004 - Archive for Mathematical Logic 43 (2):193-213.
□ On the singular cardinals.James Cummings & Sy-David Friedman - 2008 - Journal of Symbolic Logic 73 (4):1307-1314.
Coding into Inner Models at the Level of Strong Cardinals.Marios Koulakis - 2018 - Bulletin of Symbolic Logic 24 (4):456-456.
The combinatorial essence of supercompactness.Christoph Weiß - 2012 - Annals of Pure and Applied Logic 163 (11):1710-1717.

Analytics

Added to PP
2009-01-28

Downloads
7 (#1,413,139)

6 months
30 (#108,935)

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