Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1109.5283

Chains of Baire class 1 functions and various notions of special trees

Márton Elekes·Juris Steprāns
View original source ↗Read source document ↗Export metadata ↓

Abstract

Following Laczkovich we consider the partially ordered set $\iB_1(\RR)$ of Baire class 1 functions endowed with the pointwise order, and investigate the order types of the linearly ordered subsets. Answering a question of Komjáth and Kunen we show (in $ZFC$) that special Aronszajn lines are embeddable into $\iB_1(\RR)$. We also show that under Martin's Axiom a linearly ordered set $\mathbb{L}$ with $|\mathbb{L}|<2^ω$ is embeddable into $\iB_1(\RR)$ iff $\mathbb{L}$ does not contain a copy of $ω_1$ or $ω_1^*$. We present a $ZFC$-example of a linear order of size $2^ω$ showing that this characterisation is not valid for orders of size continuum. These results are obtained using the notion of a compact-special tree; that is, a tree that is embeddable into the class of compact subsets of the reals partially ordered under reverse inclusion. We investigate how this notion is related to the well-known notion of an $\RR$-special tree and also to some other notions of specialness.

Explore related subjects

math.LOmath.CAmath.GN

Keep this discovery

BibTeXRIS

Márton Elekes, Juris Steprāns. 2011-09-28. Chains of Baire class 1 functions and various notions of special trees. https://arxiv.org/abs/1109.5283

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↗