SearcharxivSearch

arXiv · 1306.0204

On critical cardinalities related to $Q$-sets

Abstract

In this note we collect some known information and prove new results about the small uncountable cardinal $\mathfrak q_0$. The cardinal $\mathfrak q_0$ is defined as the smallest cardinality $|A|$ of a subset $A\subset \mathbb R$ which is not a $Q$-set (a subspace $A\subset\mathbb R$ is called a $Q$-set if each subset $B\subset A$ is of type $F_\sigma$ in $A$). We present a simple proof of a folklore fact that $\mathfrak p\le\mathfrak q_0\le\min\{\mathfrak b,\mathrm{non}(\mathcal N),\log(\mathfrak c^+)\}$, and also establish the consistency of a number of strict inequalities between the cardinal $\mathfrak q_0$ and other standard small uncountable cardinals. This is done by combining some known forcing results. A new result of the paper is the consistency of $\mathfrak{p} < \mathfrak{lr} < \mathfrak{q}_0$, where $\mathfrak{lr}$ denotes the linear refinement number. Another new result is the upper bound $\mathfrak q_0\le\mathrm{non}(\mathcal I)$ holding for any $\mathfrak q_0$-flexible cccc $\sigma$-ideal $\mathcal I$ on $\mathbb R$.

Explore related subjects

Keep this discovery

BibTeXRIS

Taras Banakh, Michal Machura, Lubomyr Zdomskyy. 2013-06-02. On critical cardinalities related to $Q$-sets. https://arxiv.org/abs/1306.0204

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