SearcharxivSearch

arXiv · 1505.00368

Continuous and other finitely generated canonical cofinal maps on ultrafilters

Abstract

This paper investigates conditions under which canonical cofinal maps of the following three types exist: continuous, generated by finitary end-extension preserving maps, and generated by finitary maps. The main theorems prove that every monotone cofinal map on an ultrafilter from a certain class of ultrafilters is actually canonical when restricted to some cofinal subset. These theorems are then applied to find connections between Tukey, Rudin-Keisler, and Rudin-Blass reducibilities on large classes of ultrafilters. The main theorems on canonical cofinal maps are the following. Under a mild assumption, basic Tukey reductions are inherited under Tukey reduction. In particular, every ultrafilter Tukey reducible to a p-point has continuous Tukey reductions. If $\mathcal{U}$ is a Fubini iterate of p-points, then each monotone cofinal map from $\mathcal{U}$ to some other ultrafilter is generated (on a cofinal subset of $\mathcal{U}$) by a finitary map on the base tree for $\mathcal{U}$ which is monotone and end-extension preserving - the analogue of continuous in this context. Further, every ultrafilter which is Tukey reducible to some Fubini iterate of p-points has finitely generated cofinal maps. Similar theorems also hold for some other classes of ultrafilters.

Explore related subjects

Keep this discovery

BibTeXRIS

Natasha Dobrinen. 2015-05-02. Continuous and other finitely generated canonical cofinal maps on ultrafilters. https://arxiv.org/abs/1505.00368

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