A universal indestructibility theorem compatible with level by level equivalence

Archive for Mathematical Logic 54 (3-4):463-470 (2015)
  Copy   BIBTEX

Abstract

We prove an indestructibility theorem for degrees of supercompactness that is compatible with level by level equivalence between strong compactness and supercompactness.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,937

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
2015-03-22

Downloads
15 (#1,233,030)

6 months
5 (#1,039,842)

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

On strong compactness and supercompactness.Telis K. Menas - 1975 - Annals of Mathematical Logic 7 (4):327-359.
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.
Small forcing makes any cardinal superdestructible.Joel Hamkins - 1998 - Journal of Symbolic Logic 63 (1):51-58.

View all 10 references / Add more references