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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

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
2023-01-05

Downloads
17 (#1,196,561)

6 months
6 (#572,300)

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 6 references / Add more references