- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Unfoldable cardinals and the GCH
Journal of Symbolic Logic 66 (3):1186-1198 (2001)
Abstract
Unfoldable cardinals are preserved by fast function forcing and the Laver-like preparations that fast functions support. These iterations show, by set-forcing over any model of ZFC, that any given unfoldable cardinal κ can be made indestructible by the forcing to add any number of Cohen subsets to κAuthor's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Strongly unfoldable cardinals made indestructible.Thomas A. Johnstone - 2008 - Journal of Symbolic Logic 73 (4):1215-1248.
Diamond (on the regulars) can fail at any strongly unfoldable cardinal.Mirna Džamonja & Joel David Hamkins - 2006 - Annals of Pure and Applied Logic 144 (1-3):83-95.
The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
Superstrong and other large cardinals are never Laver indestructible.Joan Bagaria, Joel David Hamkins, Konstantinos Tsaprounis & Toshimichi Usuba - 2016 - Archive for Mathematical Logic 55 (1-2):19-35.
Strongly unfoldable, splitting and bounding.Ömer Faruk Bağ & Vera Fischer - 2023 - Mathematical Logic Quarterly 69 (1):7-14.
Small forcing makes any cardinal superdestructible.Joel Hamkins - 1998 - Journal of Symbolic Logic 63 (1):51-58.
Indestructible Strong Unfoldability.Joel David Hamkins & Thomas A. Johnstone - 2010 - Notre Dame Journal of Formal Logic 51 (3):291-321.
Strong Cardinals can be Fully Laver Indestructible.Arthur W. Apter - 2002 - Mathematical Logic Quarterly 48 (4):499-507.
Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata.J. D. Hamkins & A. W. Apter - 2001 - Mathematical Logic Quarterly 47 (4):563-572.
Analytics
Added to PP
2009-01-28
Downloads
100 (#212,456)
6 months
18 (#166,022)
2009-01-28
Downloads
100 (#212,456)
6 months
18 (#166,022)
Historical graph of downloads
Author's Profile
Citations of this work
Resurrection axioms and uplifting cardinals.Joel David Hamkins & Thomas A. Johnstone - 2014 - Archive for Mathematical Logic 53 (3-4):463-485.
Indestructible Strong Unfoldability.Joel David Hamkins & Thomas A. Johnstone - 2010 - Notre Dame Journal of Formal Logic 51 (3):291-321.
Diamond (on the regulars) can fail at any strongly unfoldable cardinal.Mirna Džamonja & Joel David Hamkins - 2006 - Annals of Pure and Applied Logic 144 (1-3):83-95.
Strongly uplifting cardinals and the boldface resurrection axioms.Joel David Hamkins & Thomas A. Johnstone - 2017 - Archive for Mathematical Logic 56 (7-8):1115-1133.
The least weakly compact cardinal can be unfoldable, weakly measurable and nearly $${\theta}$$ θ -supercompact.Brent Cody, Moti Gitik, Joel David Hamkins & Jason A. Schanker - 2015 - Archive for Mathematical Logic 54 (5-6):491-510.
References found in this work
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Andrkka, H., Givant, S., Mikulb, S., Ntmeti, I. and Simon, A.C. Butz, P. Johnstone, J. Gallier, J. D. Hamkins, B. Khoussaiuov, H. Lombardi & C. Raffalli - 1998 - Annals of Pure and Applied Logic 91 (1):271.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lv8mh dc2