SearcharxivSearch

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 $\Pi_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 $\phi$ gives rise to a localization axiom $Loc^{\phi}({\rm ZFC})$ saying that every set belongs to a transitive model of ZFC satisfying $\phi$. The theories ${\rm LZFC}^\phi={\rm LZFC}$+$Loc^{\phi}({\rm ZFC})$ are local analogues of the theories ZFC+"there is a proper class of large cardinals $\psi$", where $\psi$ is a large cardinal property. If $sext(x)$ is the property of strong extendibility, it is shown that ${\rm LZFC}^{sext}$ proves Powerset and $\Sigma_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\v{e}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

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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO