Search arXivSearch

arXiv · 1506.03488

Local Ramsey theory. An abstract approach

Abstract

Given a topological Ramsey space $(\mathcal R,\leq, r)$, we extend the notion of semiselective coideal to sets $\mathcal H\subseteq\mathcal R$ and study conditions for $\mathcal H$ that will enable us to make the structure $(\mathcal R,\mathcal H,\leq, r)$ a Ramsey space (not necessarily topological) and also study forcing notions related to $\mathcal H$ which will satisfy abstract versions of interesting properties of the corresponding forcing notions in the realm of Ellentuck's space. This extends results of Farah, and results of Mijares, to the most general context of topological Ramsey spaces. As applications, we prove that for every topological Ramsey space $\mathcal R$, under suitable large cardinal hypotheses every semiselective ultrafilter $\mathcal U\subseteq\mathcal R$ is generic over $L(\mathbb R)$; and that given a semiselective coideal $\mathcal H\subseteq\mathcal R$, every definable subset of $\mathcal R$ is $\mathcal H$--Ramsey. This generalizes the corresponding results for the case when $\mathcal R$ is equal to Ellentuck's space.

Explore related subjects

Keep this discovery

BibTeXRIS

Carlos Di Prisco, Jose G. Mijares, Jesus Nieto. 2015-06-10. Local Ramsey theory. An abstract approach. https://arxiv.org/abs/1506.03488

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