SearcharxivSearch

arXiv · 1401.2835

Ramsey for $\mathcal{R}_{1}$ ultrafilter mappings and their Dedekind cuts

Abstract

Associated to each ultrafilter $\mathcal{U}$ on $\omega$ and each map $p:\omega\rightarrow \omega$ is a Dedekind cut in the ultrapower $\omega^{\omega}/p( \mathcal{U})$. Blass has characterized, under CH, the cuts obtainable when $\mathcal{U}$ is taken to be either a p-point ultrafilter, a weakly-Ramsey ultrafilter or a Ramsey ultrafilter. Dobrinen and Todorcevic have introduced the topological Ramsey space $\mathcal{R}_{1}$. Associated to the space $\mathcal{R}_{1}$ is a notion of Ramsey ultrafilter for $\mathcal{R}_{1}$ generalizing the familiar notion of Ramsey ultrafilter on $\omega$. We characterize, under CH, the cuts obtainable when $\mathcal{U}$ is taken to be a Ramsey for $\mathcal{R}_{1}$ ultrafilter and $p$ is taken to be any map. In particular, we show that the only cut obtainable is the standard cut, whose lower half consists of the collection of equivalence classes of constants maps. Forcing with $\mathcal{R}_{1}$ using almost-reduction adjoins an ultrafilter which is Ramsey for $\mathcal{R}_{1}$. For such ultrafilters $\mathcal{U}_{1}$, Dobrinen and Todorcevic have shown that the Rudin-Keisler types of the p-points within the Tukey type of $\mathcal{U}_{1}$ consists of a strictly increasing chain of rapid p-points of order type $\omega$. We show that for any Rudin-Keisler mapping between any two p-points within the Tukey type of $\mathcal{U}_{1}$ the only cut obtainable is the standard cut. These results imply existence theorems for special kinds of ultrafilters.

Explore related subjects

Keep this discovery

BibTeXRIS

Timothy Trujillo. 2014-01-13. Ramsey for $\mathcal{R}_{1}$ ultrafilter mappings and their Dedekind cuts. https://arxiv.org/abs/1401.2835

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