SearcharxivSearch

arXiv · 2601.09061

Properties of Laver forcing associated with a co-ideal expressed via the Katetov order

Abstract

We study variants of classical Laver forcing defined from co-ideals and analyze their combinatorial properties in terms of the Kat\v{e}tov order. In particular, we give a Kat\v{e}tov-theoretic characterization of when Laver forcing associated with a co-ideal adds Cohen reals, and we show that such forcings never add random reals. Improving a result of B{\l}aszczyk and Shelah we prove that the addition of Cohen reals and the Laver property are not equivalent, even in the case of ultrafilters. As an application, we investigate the problem of adding half Cohen reals without adding Cohen reals via tree-like forcings arising from co-ideals. We obtain several partial results and structural obstructions. Finally, we resolve several open questions from the literature concerning the one-to-one or constant property and cardinal invariants associated with ideals.

Explore related subjects

Keep this discovery

BibTeXRIS

Osvaldo Guzmán, Francisco Santiago Nieto-de la Rosa, Ulises Ariet Ramos-Garcia. 2026-01-14. Properties of Laver forcing associated with a co-ideal expressed via the Katetov order. https://arxiv.org/abs/2601.09061

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