SearcharxivSearch

arXiv · 1312.5411

Selective but not Ramsey

Abstract

We give a partial answer to the following question of Dobrinen: For a given topological Ramsey space $\mathcal{R}$, are the notions of selective for $\mathcal{R}$ and Ramsey for $\mathcal{R}$ equivalent? Every topological Ramsey space $\mathcal{R}$ has an associated notion of Ramsey ultrafilter for $\mathcal{R}$ and selective ultrafilter for $\mathcal{R}$ (see \cite{MijaresSelective}). If $\mathcal{R}$ is taken to be the Ellentuck space then the two concepts reduce to the familiar notions of Ramsey and selective ultrafilters on $ω$; so by a well-known result of Kunen the two are equivalent. We give the first example of an ultrafilter on a topological Ramsey space that is selective but not Ramsey for the space, and in fact a countable collection of such examples. For each positive integer $n$ we show that for the topological Ramsey space $\mathcal{R}_{n}$ from \cite{Ramsey-Class2}, the notions of selective for $\mathcal{R}_{n}$ and Ramsey for $\mathcal{R}_{n}$ are not equivalent. In particular, we prove that forcing with a closely related space using almost-reduction, adjoins an ultrafilter that is selective but not Ramsey for $\mathcal{R}_{n}$. Moreover, we introduce a notion of finite product among members of the family $\{\mathcal{R}_{n}: n<ω\}$. We show that forcing with closely related product spaces using almost-reduction, adjoins ultrafilters that are selective but not Ramsey for these product topological Ramsey spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Timothy Trujillo. 2013-12-19. Selective but not Ramsey. https://arxiv.org/abs/1312.5411

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