Determinacy and Large Cardinals

Sandra Müller

Home/Archive/arXiv

arXiv · 2302.02248

Determinacy and Large Cardinals

Sandra Müller

View original source ↗Read source document ↗Export metadata ↓

Abstract

The study of inner models was initiated by G\"odel's analysis of the constructible universe. Later, the study of canonical inner models with large cardinals, e.g., measurable cardinals, strong cardinals or Woodin cardinals, was pioneered by Jensen, Mitchell, Steel, and others. Around the same time, the study of infinite two-player games was driven forward by Martin's proof of analytic determinacy from a measurable cardinal, Borel determinacy from ZFC, and Martin and Steel's proof of levels of projective determinacy from Woodin cardinals with a measurable cardinal on top. First Woodin and later Neeman improved the result in the projective hierarchy by showing that in fact the existence of a countable iterable model, a mouse, with Woodin cardinals and a top measure suffices to prove determinacy in the projective hierarchy. This opened up the possibility for an optimal result stating the equivalence between local determinacy hypotheses and the existence of mice in the projective hierarchy. This article outlines the main concepts and results connecting determinacy hypotheses with the existence of mice with large cardinals as well as recent progress in the area.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Sandra Müller. 2023-02-04. Determinacy and Large Cardinals. https://arxiv.org/abs/2302.02248

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗