Search arXivSearch

arXiv · 1406.1291

High dimensional Ellentuck spaces and initial chains in the Tukey structure of non-p-points

Abstract

The generic ultrafilter $\mathcal{G}_2$ forced by $\mathcal{P}(\omega\times\omega)/($Fin$\otimes$Fin) was recently proved to be neither maximum nor minimum in the Tukey order of ultrafilters (in a recent paper of Blass, Dobrinen, and Raghavan), but it was left open where exactly in the Tukey order it lies. We prove that $\mathcal{G}_2$ is in fact Tukey minimal over its projected Ramsey ultrafilter. Furthermore, we prove that for each $k\ge 2$, the collection of all nonprincipal ultrafilters Tukey reducible to the generic ultrafilter $\mathcal{G}_k$ forced by $\mathcal{P}(\omega^k)/$Fin$^{\otimes k}$ forms a chain of length $k$. Essential to the proof is the extraction of a dense subset $\mathcal{E}_k$ from (Fin$^{\otimes k})^+$ which we prove to be a topological Ramsey space. The spaces $\mathcal{E}_k$, $k\ge 2$, form a hiearchy of high dimensional Ellentuck spaces. New Ramsey-classification theorems for equivalence relations on fronts on $\mathcal{E}_k$ are proved, extending the Pudlak-Rodl Theorem for fronts on the Ellentuck space, which are applied to find the Tukey structure below $\mathcal{G}_k$.

Explore related subjects

Keep this discovery

BibTeXRIS

Natasha Dobrinen. 2014-06-05. High dimensional Ellentuck spaces and initial chains in the Tukey structure of non-p-points. https://arxiv.org/abs/1406.1291

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