Search arXivSearch

arXiv · math/9211202

Combinatorial properties of Hechler forcing

Abstract

In this work we use a notion of rank first introduced by James Baumgartner and Peter Dordal and later developed independently by the third author to show that adding a Hechler real has strong combinatorial consequences. We prove: 1) assuming omega_1^V = omega_1^L, there is no real in V[d] which is eventually different from the reals in L[d], where d is Hechler over V; 2) adding one Hechler real makes the invariants on the left-hand side of Cicho'n's diagram equal omega_1 and those on the right-hand side equal 2^omega and produces a maximal almost disjoint family of subsets of omega of size omega_1; 3) there is no perfect set of random reals over V in V[r][d], where r is random over V and d Hechler over V[r], thus answering a question of the first and second authors. As an intermediate step in the proof of 3) we show that given models M subseteq N of ZFC such that there is a perfect set of random reals in N over M, either there is a dominating real in N over M or mu (2^omega cap M) = 0 in N.

Explore related subjects

Keep this discovery

BibTeXRIS

Jörg Brendle, Haim Judah, Saharon Shelah. 1992-11-03. Combinatorial properties of Hechler forcing. https://arxiv.org/abs/math/9211202

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