Reducing the consistency strength of an indestructibility theorem

Mathematical Logic Quarterly 54 (3):288-293 (2008)
  Copy   BIBTEX

Abstract

Using an idea of Sargsyan, we show how to reduce the consistency strength of the assumptions employed to establish a theorem concerning a uniform level of indestructibility for both strong and supercompact cardinals

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

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

Analytics

Added to PP
2013-12-01

Downloads
28 (#807,648)

6 months
5 (#1,067,832)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The large cardinals between supercompact and almost-huge.Norman Lewis Perlmutter - 2015 - Archive for Mathematical Logic 54 (3-4):257-289.
On extensions of supercompactness.Robert S. Lubarsky & Norman Lewis Perlmutter - 2015 - Mathematical Logic Quarterly 61 (3):217-223.

Add more citations

References found in this work

The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Strong Cardinals can be Fully Laver Indestructible.Arthur W. Apter - 2002 - Mathematical Logic Quarterly 48 (4):499-507.

Add more references