SearcharxivSearch

arXiv · 2112.12881

Classifying invariants for $E_1$: A tail of a generic real

Abstract

Let $E$ be an analytic equivalence relation on a Polish space. We introduce a framework for studying the possible "reasonable" complete classifications and the complexity of possible classifying invariants for $E$, such that: (1) the standard results and intuitions regarding classifications by countable structures are preserved in this framework; (2) this framework respects Borel reducibility; (3) this framework allows for a precise study of the possible invariants of certain equivalence relations which are not classifiable by countable structures, such as $E_1$. In this framework we show that $E_1$ can be classified, with classifying invariants which are $κ$-sequences of $E_0$-classes where $κ=\mathfrak{b}$, and it cannot be classified in such a manner if $κ<\mathbf{add}(\mathcal{B})$. These results depend on analyzing the following sub-model of a Cohen real extension, introduced by Kanovei-Sabok-Zapletal (2013) and Larson-Zapletal (2020). Let $\left $ be a generic sequence of Cohen reals, and define the tail intersection model $$M=\bigcap_{n<ω}V[\left ].$$ An analysis of reals in $M$ will provide lower bounds for the possible invariants for $E_1$. We also extend the characterization of turbulence from Larson-Zapletal (2020) in terms of intersection models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Assaf Shani. 2021-12-23. Classifying invariants for $E_1$: A tail of a generic real. https://arxiv.org/abs/2112.12881

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