Iterating the Cofinality- Constructible Model

Journal of Symbolic Logic 88 (4):1682-1691 (2023)
  Copy   BIBTEX

Abstract

We investigate iterating the construction of $C^{*}$, the L-like inner model constructed using first order logic augmented with the “cofinality $\omega $ ” quantifier. We first show that $\left (C^{*}\right )^{C^{*}}=C^{*}\ne L$ is equiconsistent with $\mathrm {ZFC}$, as well as having finite strictly decreasing sequences of iterated $C^{*}$ s. We then show that in models of the form $L[U]$ we get infinite decreasing sequences of length $\omega $, and that an inner model with a measurable cardinal is required for that.

Links

PhilArchive



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

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

On changing cofinality of partially ordered sets.Moti Gitik - 2010 - Journal of Symbolic Logic 75 (2):641-660.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Antichains in partially ordered sets of singular cofinality.Assaf Rinot - 2007 - Archive for Mathematical Logic 46 (5-6):457-464.
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The cofinality of the random graph.Steve Warner - 2001 - Journal of Symbolic Logic 66 (3):1439-1446.
The internal consistency of Easton’s theorem.Sy-David Friedman & Pavel Ondrejovič - 2008 - Annals of Pure and Applied Logic 156 (2):259-269.
Same graph, different universe.Assaf Rinot - 2017 - Archive for Mathematical Logic 56 (7-8):783-796.
Full reflection of stationary sets below ℵω.Thomas Jech & Saharon Shelah - 1990 - Journal of Symbolic Logic 55 (2):822 - 830.

Analytics

Added to PP
2023-01-05

Downloads
9 (#1,247,499)

6 months
7 (#419,303)

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

Iterated ultrapowers and prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109-160.
Iterating ordinal definability.Wlodzimierz Zadrozny - 1983 - Annals of Mathematical Logic 24 (3):263-310.
Consistency results about ordinal definability.Kenneth McAloon - 1971 - Annals of Mathematical Logic 2 (4):449.
Transfinite descending sequences of models HODα.Wo̵dzimierz Zadroźny - 1981 - Annals of Mathematical Logic 20 (2):201-229.

View all 8 references / Add more references