Search arXivSearch

arXiv · 2303.15287

Large transitive models in local {\rm ZFC}

Abstract

This paper is a sequel to \cite{Tz10}, where a local version of ZFC, LZFC, was introduced and examined and transitive models of ZFC with properties that resemble large cardinal properties, namely Mahlo and $Π_1^1$-indescribable models, were considered. By analogy we refer to such models as "large models", and the properties in question as "large model properties". Continuing here in the same spirit we consider further large model properties, that resemble stronger large cardinals, namely, "elementarily embeddable", "extendible" and "strongly extendible", "critical" and "strongly critical", "self-critical'' and "strongly self-critical", the definitions of which involve elementary embeddings. Each large model property $ϕ$ gives rise to a localization axiom $Loc^ϕ({\rm ZFC})$ saying that every set belongs to a transitive model of ZFC satisfying $ϕ$. The theories ${\rm LZFC}^ϕ={\rm LZFC}$+$Loc^ϕ({\rm ZFC})$ are local analogues of the theories ZFC+"there is a proper class of large cardinals $ψ$", where $ψ$ is a large cardinal property. If $sext(x)$ is the property of strong extendibility, it is shown that ${\rm LZFC}^{sext}$ proves Powerset and $Σ_1$-Collection. In order to refute $V=L$ over LZFC, we combine the existence of strongly critical models with an axiom of different flavor, the Tall Model Axiom ($TMA$). $V=L$ can also be refuted by $TMA$ plus the axiom $GC$ saying that "there is a greatest cardinal", although it is not known if $TMA+GC$ is consistent over LZFC. Finally Vopěnka's Principle ($VP$) and its impact on LZFC are examined. It is shown that ${\rm LZFC}^{sext}+VP$ proves Powerset and Replacement, i.e., ZFC is fully recovered. The same is true for some weaker variants of ${\rm LZFC}^{sext}$. Moreover the theories LZFC$^{sext}$+$VP$ and ZFC+$VP$ are shown to be identical.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Athanassios Tzouvaras. 2023-03-27. Large transitive models in local {\rm ZFC}. https://doi.org/10.1007/s00153-013-0364-5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO