On shattering, splitting and reaping partitions

Lorenz Halbeisen

Home/Archive/arXiv

arXiv · math/0109099

On shattering, splitting and reaping partitions

Lorenz Halbeisen

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this article we investigate the dual-shattering cardinal H, the dual-splitting cardinal S and the dual-reaping cardinal R, which are dualizations of the well-known cardinals h (the shattering cardinal, also known as the distributivity number of P(omega) modulo finite, s (the splitting number) and r (the reaping number). Using some properties of the ideal J of nowhere dual-Ramsey sets, which is an ideal over the set of partitions of omega, we show that add(J)=cov(J)=H. With this result we can show that H > omega_1 is consistent with ZFC and as a corollary we get the relative consistency of H > t, where t is the tower number. Concerning S we show that cov(M) is less than or equal to S (where M is the ideal of the meager sets). For the dual-reaping cardinal R we get p is less than or equal to R, which is less than or equal to r (where p is the pseudo-intersection number) and for a modified dual-reaping number R' we get that R' is less than or equal to d (where d is the dominating number). As a consistency result we get R < cov(M).

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Lorenz Halbeisen. 2001-09-16. On shattering, splitting and reaping partitions. https://arxiv.org/abs/math/0109099

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↗