Partitioning pairs of countable sets of ordinals

Journal of Symbolic Logic 55 (3):1019-1021 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274470

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,859

External links

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

Through your library

My notes

Similar books and articles

Order types of ordinals in models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (2):489-502.
Menachem Magidor. Representing sets of ordinals as countable unions of sets in the core model. Transactions of the American Mathematical Society, vol. 317 , pp. 91–126. [REVIEW]Philip Welch - 1995 - Journal of Symbolic Logic 60 (2):701-704.
The reals in core models.Philip Welch - 1987 - Journal of Symbolic Logic 52 (1):64-67.
A simplification of the Bachmann method for generating large countable ordinals.Jane Bridge - 1975 - Journal of Symbolic Logic 40 (2):171-185.
Lifting proof theory to the countable ordinals: Zermelo-Fraenkel set theory.Toshiyasu Arai - 2014 - Journal of Symbolic Logic 79 (2):325-354.
Daniel J. Velleman, Morasses, diamond, and forcing, Annals of mathematical logic, vol. 23 , pp. 199–281. - Dan Velleman. On a generalization of Jensen's □κ, and strategic closure of partial orders, The journal of symbolic logic, vol. 48, no. 4 , pp. 1046–1052. [REVIEW]Lee Stanley - 1989 - Journal of Symbolic Logic 54 (2):639-646.
Metarecursively Enumerable Sets and Admissible Ordinals.Gerald E. Sacks & Graham C. Driscoll - 1969 - Journal of Symbolic Logic 34 (1):115-116.
Countable unions of simple sets in the core model.P. D. Welch - 1996 - Journal of Symbolic Logic 61 (1):293-312.
Games of countable length. Sets and Proofs. [REVIEW]Paul B. Larson - 2005 - Bulletin of Symbolic Logic 11 (4):542-544.
Countable Admissible Ordinals and Dilators.Gerhard Jäger - 1986 - Mathematical Logic Quarterly 32 (25-30):451-456.

Analytics

Added to PP
2009-01-28

Downloads
47 (#521,775)

6 months
13 (#258,957)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Morasses, square and forcing axioms.Charles Morgan - 1996 - Annals of Pure and Applied Logic 80 (2):139-163.

Add more citations

References found in this work

Menas' conjecture and generic ultrapowers.Yo Matsubara - 1987 - Annals of Pure and Applied Logic 36:225-234.

Add more references