Rado's conjecture and presaturation of the nonstationary ideal on ω1

Journal of Symbolic Logic 64 (1):38-44 (1999)
  Copy   BIBTEX

Abstract

We prove that Rado's Conjecture implies that the nonstationary ideal on ω 1 is presaturated

Categories

Keywords

Reprint years

DOI

10.2307/2586748

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Rado's conjecture and presaturation of the nonstationary ideal on omega.F. Qi - 1999 - Journal of Symbolic Logic 64:38-44.
Conjectures of Rado and Chang and special Aronszajn trees.Stevo Todorčević & Víctor Torres Pérez - 2012 - Mathematical Logic Quarterly 58 (4-5):342-347.
Conjectures of Rado and Chang and special Aronszajn trees.Stevo Todorčević & Víctor Torres Pérez - 2012 - Mathematical Logic Quarterly 58 (4):342-347.
Variations of Rado's lemma.Paul Howard - 1993 - Mathematical Logic Quarterly 39 (1):353-356.
The Nonstationary Ideal in the Pmax Extension.Paul B. Larson - 2007 - Journal of Symbolic Logic 72 (1):138 - 158.
Increasing u 2 by a stationary set preserving forcing.Benjamin Claverie & Ralf Schindler - 2009 - Journal of Symbolic Logic 74 (1):187-200.
[Omnibus Review].James E. Baumgartner - 1985 - Journal of Symbolic Logic 50 (1):239-240.
A Tail Club Guessing Ideal Can Be Saturated without Being a Restriction of the Nonstationary Ideal.Tetsuya Ishiu - 2005 - Notre Dame Journal of Formal Logic 46 (3):327-333.
Saturation, Suslin trees and meager sets.Paul Larson - 2005 - Archive for Mathematical Logic 44 (5):581-595.
Rado's Conjecture and Ascent Paths of Square Sequences.Stevo Todorčević & Víctor Torres Pérez - 2014 - Mathematical Logic Quarterly 60 (1-2):84-90.
P-points in Qmax models.Q. Feng & W. H. Woodin - 2003 - Annals of Pure and Applied Logic 119 (1-3):121-190.
Review: Shen Lin, Tibor Rado, Computer Studies of Turing Machine Problems; Allen H. Brady, The Conjectured Highest Scoring Machines for Rado's $sum(k)$ for the Value $K = 4$; Milton W. Green, A Lower Bound on Rado's Sigma Function for Binary Turing Machines. [REVIEW]H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (4):617-617.
I[ω₂] Can Be The Nonstationary Ideal On Cof. [REVIEW]Martin Zeman - 2011 - Bulletin of Symbolic Logic 17 (4):535-536.
WJ Mitchell, I [ω2] can be the nonstationary ideal on Cof (ω1).Martin Zeman - 2011 - Bulletin of Symbolic Logic 17 (4):535.
On precipitousness of the nonstationary ideal over a supercompact.Moti Gitik - 1986 - Journal of Symbolic Logic 51 (3):648-662.

Analytics

Added to PP
2009-01-28

Downloads
40 (#389,966)

6 months
11 (#225,837)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Combinatorial dichotomies in set theory.Stevo Todorcevic - 2011 - Bulletin of Symbolic Logic 17 (1):1-72.
Bounded dagger principles.Toshimichi Usuba - 2014 - Mathematical Logic Quarterly 60 (4-5):266-272.
Rado’s Conjecture and its Baire version.Jing Zhang - 2019 - Journal of Mathematical Logic 20 (1):1950015.

Add more citations

References found in this work

Set Theory.Keith J. Devlin - 1981 - Journal of Symbolic Logic 46 (4):876-877.
Countable approximations and Löwenheim-Skolem theorems.David W. Kueker - 1977 - Annals of Mathematical Logic 11 (1):57.

Add more references