SearcharxivSearch

arXiv · 2401.01979

Low level definability above large cardinals

Abstract

We study connections between definability in generalized descriptive set theory and large cardinals, under ZFC. We show that if $\kappa$ is a limit of measurables then there is no wellorder of a subset of $P(\kappa)$ of length $\geq\kappa^+$ which is $\Sigma_1(V_\kappa\cup\mathrm{OR})$, answering a question of L\"ucke and M\"uller. However, consistently, a Woodin cardinal exists and for every uncountable cardinal $\kappa$ which is not a limit of measurables, there is a $\Sigma_1(H_\kappa\cup\{\kappa\})$-good wellorder of $H_{\kappa^+}$. If $\kappa$ is a limit of measurables and $\kappa$ has uncountable cofinality then there is no $\Sigma_1(V_\kappa\cup\mathrm{OR})$ almost disjoint family $F\subseteq P(\kappa)$ of cardinality $>\kappa$. Consistently, $\Pi_1(\{\kappa\})$ mad families and maximal independent families $F\subseteq P(\kappa)$ exist, $\kappa$ is a limit of measurables, and more. If $\kappa$ is weakly compact and every $\Sigma_1(V_\kappa\cup\{\kappa\})$ subset of $P(\kappa)$ of cardinality $>\kappa$ contains a perfect subset of the right kind, then there is an inner model with a weakly compact limit of measurables. We prove some related facts regarding $\Sigma_1(V_\lambda\cup\{V_\lambda\}\cup\mathrm{OR})$ when $I_2(\lambda)$ holds. These depend on an analysis of fixed points of linear iterations involving $I_2(\lambda)$-extenders.

Explore related subjects

Keep this discovery

BibTeXRIS

Farmer Schlutzenberg. 2024-01-03. Low level definability above large cardinals. https://arxiv.org/abs/2401.01979

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