Strong downward Löwenheim–Skolem theorems for stationary logics, II: reflection down to the continuum

Archive for Mathematical Logic 60 (3):495-523 (2021)
  Copy   BIBTEX

Abstract

Continuing, we study the Strong Downward Löwenheim–Skolem Theorems of the stationary logic and their variations. In Fuchino et al. it has been shown that the SDLS for the ordinary stationary logic with weak second-order parameters \. This SDLS is shown to be equivalent to an internal version of the Diagonal Reflection Principle down to an internally stationary set of size \. We also consider a version of the stationary logic and show that the SDLS for this logic in internal interpretation \\) for reflection down to \ is consistent under the assumption of the consistency of ZFC \ “the existence of a supercompact cardinal” and this SDLS implies that the continuum is weakly Mahlo. These three “axioms” in terms of SDLS are consequences of three instances of a strengthening of generic supercompactness which we call Laver-generic supercompactness. Existence of a Laver-generic supercompact cardinal in each of these three instances also fixes the cardinality of the continuum to be \ or \ or very large respectively. We also show that the existence of one of these generic large cardinals implies the “\” version of the corresponding forcing axiom.

Links

PhilArchive



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

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

Generic compactness reformulated.Bernhard König - 2004 - Archive for Mathematical Logic 43 (3):311-326.
Indestructibility and stationary reflection.Arthur W. Apter - 2009 - Mathematical Logic Quarterly 55 (3):228-236.
Club-guessing, stationary reflection, and coloring theorems.Todd Eisworth - 2010 - Annals of Pure and Applied Logic 161 (10):1216-1243.
Stationary Cardinals.Wenzhi Sun - 1993 - Archive for Mathematical Logic 32 (6):429-442.
Local saturation of the non-stationary ideal over Pκλ.Toshimichi Usuba - 2007 - Annals of Pure and Applied Logic 149 (1-3):100-123.
Semistationary and stationary reflection.Hiroshi Sakai - 2008 - Journal of Symbolic Logic 73 (1):181-192.
The Downward Transfer of Elementary Satisfiability of Partition Logics.Y. Chen & E. Shen - 2000 - Mathematical Logic Quarterly 46 (4):477-488.
There is no recursive link between the k-size of a model and its cardinality.R. Barker - 2002 - Annals of Pure and Applied Logic 118 (3):235-247.

Analytics

Added to PP
2021-01-07

Downloads
21 (#734,423)

6 months
6 (#510,793)

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

Laver sequences for extendible and super-almost-huge cardinals.Paul Corazza - 1999 - Journal of Symbolic Logic 64 (3):963-983.
On the existence of skinny stationary subsets.Yo Matsubara, Hiroshi Sakai & Toshimichi Usuba - 2019 - Annals of Pure and Applied Logic 170 (5):539-557.
Laver Sequences for Extendible and Super-Almost-Huge Cardinals.Paul Corazza - 1999 - Journal of Symbolic Logic 64 (3):963-983.

Add more references