On a problem of Foreman and Magidor

Archive for Mathematical Logic 44 (4):493-498 (2005)
  Copy   BIBTEX

Abstract

A question of Foreman and Magidor asks if it is consistent for every sequence of stationary subsets of the ℵ n ’s for 1≤n<ω to be mutually stationary. We get a positive answer to this question in the context of the negation of the Axiom of Choice. We also indicate how a positive answer to a generalized version of this question in a choiceless context may be obtained

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

Similar books and articles

Reducing the consistency strength of an indestructibility theorem.Arthur W. Apter - 2008 - Mathematical Logic Quarterly 54 (3):288-293.
On some questions concerning strong compactness.Arthur W. Apter - 2012 - Archive for Mathematical Logic 51 (7-8):819-829.
An equiconsistency for universal indestructibility.Arthur W. Apter & Grigor Sargsyan - 2010 - Journal of Symbolic Logic 75 (1):314-322.
Identity crises and strong compactness.Arthur W. Apter & James Cummings - 2000 - Journal of Symbolic Logic 65 (4):1895-1910.
Some remarks on indestructibility and Hamkins? lottery preparation.Arthur W. Apter - 2003 - Archive for Mathematical Logic 42 (8):717-735.
A remark on the tree property in a choiceless context.Arthur W. Apter - 2011 - Archive for Mathematical Logic 50 (5-6):585-590.
Strong Cardinals can be Fully Laver Indestructible.Arthur W. Apter - 2002 - Mathematical Logic Quarterly 48 (4):499-507.
A Cardinal Pattern Inspired by AD.Arthur W. Apter - 1996 - Mathematical Logic Quarterly 42 (1):211-218.
Level by level inequivalence beyond measurability.Arthur W. Apter - 2011 - Archive for Mathematical Logic 50 (7-8):707-712.

Analytics

Added to PP
2013-11-23

Downloads
17 (#846,424)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?