SearcharxivSearch

arXiv · 1601.03831

From abstract alpha-Ramsey theory to abstract ultra-Ramsey theory

Abstract

We work within the framework of the Alpha-Theory introduced by Benci and Di Nasso. The Alpha-Theory postulates a few natural properties for an infinite "ideal" number $α$. The formulation provides an elementary axiomatics for the methods of abstract ultra-Ramsey theory. The main results are Theorem 10, Theorem 57, Theorem 67 and Theorem 73. Theorem 10 is an infinite-dimensional extension of the celebrated Ramsey's Theorem. We show that corollaries of this result include the Galvin-Pirky Theorem, the Silver Theorem and the $\vecα$-Ellentuck Theorem. We prove that, under the assumption of the $\mathfrak{c}^{+}$-enlarging property, the $\vecα$-Ellentuck Theorem is equivalent to the Ultra-Ellentuck Theorem of Todorcevic. Theorem 57 is an abstraction of Theorem 10 to the setting of triples $(\mathcal{R},\le,r)$ where $\mathcal{R}\not=\emptyset$, $\le$ is a quasi-order on $\mathcal{R}$ and $r$ is a function with domain $\mathbb{N}\times \mathcal{R}$. We use Theorem 57 to develop the Abstract $\vecα$-Ellentuck Theorem, Theorem 67, and the Abstract Ultra-Ellentuck Theorem, Theorem 73, extending the Abstract Ellentuck Theorem along the same lines as the $\vecα$-Ellentuck Theorem and Ultra-Ellentuck Theorem extend the Ellentuck Theorem, respectively. We conclude with some examples illustrating the theory and an open question related to the local Ramsey theory developed by Di Prisco, Mijares and Nieto.

Explore related subjects

Keep this discovery

BibTeXRIS

Timothy Trujillo. 2016-01-15. From abstract alpha-Ramsey theory to abstract ultra-Ramsey theory. https://arxiv.org/abs/1601.03831

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