SearcharxivSearch

arXiv · 2508.17672

New inner models from second order logics

Abstract

We define a new inner model C2(omega) based on the fragment of second order logic in which second order variables range over countable subsets of the domain. We compare C2(omega) to the previously studied inner model C(aa). We argue that C2(omega) appears to be a much bigger inner model than C(aa), although this cannot be literally true in ZFC alone. However, we conjecture that it follows from large cardinal assumptions. For example, assuming large cardinals, C2(omega) contains, for every n, an inner model with n Woodin cardinals, while C(aa) contains, under the same assumption, no inner model with a Woodin cardinal. As to large cardinals in C2(omega), we show that, assuming a Woodin limit of Woodin cardinals, the cardinal omega_1 of V is Mahlo in C2(omega). A stronger result is proved for the combination C2(omega, aa) of C(aa) and C2(omega). We also show that the question whether HOD1, a variant of HOD, is the same as HOD cannot be decided on the basis of ZFC even if we add the assumption that there are supercompact cardinals.

Explore related subjects

Keep this discovery

BibTeXRIS

Menachem Magidor, Jouko Väänänen. 2025-08-25. New inner models from second order logics. https://arxiv.org/abs/2508.17672

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