Search arXivSearch

arXiv · 1806.08583

The Higher Cicho\'n Diagram

Abstract

For a strongly inacessible cardinal $\kappa$, we investigate the relationships between the following ideals: - the ideal of meager sets in the ${<}\kappa$-box product topology - the ideal of "null" sets in the sense of [Sh:1004] (arXiv:1202.5799) - the ideal of nowhere stationary subsets of a (naturally defined) stationary set $S_{\rm pr}^\kappa \subseteq \kappa$. In particular, we analyse the provable inequalities between the cardinal characteristics for these ideals, and we give consistency results showing that certain inequalities are unprovable. While some results from the classical case ($\kappa=\omega$) can be easily generalized to our setting, some key results (such as a Fubini property for the ideal of null sets) do not hold; this leads to the surprising inequality cov(null)$\le$non(null). Also, concepts that did not exist in the classical case (in particular, the notion of stationary sets) will turn out to be relevant. We construct several models to distinguish the various cardinal characteristics; the main tools are iterations with $\mathord<\kappa$-support (and a strong "Knaster" version of $\kappa^+$-cc) and one iteration with ${\le}\kappa$-support (and a version of $\kappa$-properness).

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Baumhauer, Martin Goldstern, Saharon Shelah. 2018-06-22. The Higher Cicho\'n Diagram. https://doi.org/10.4064/fm666-4-2020

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