SearcharxivSearch

arXiv · 1907.13540

A refinement of the Ramsey hierarchy via indescribability

Abstract

A subset $S$ of a cardinal $\kappa$ is Ramsey if for every function $f:[S]^{<\omega}\to \kappa$ with $f(a)<\min a$ for all $a\in[S]^{<\omega}$, there is a set $H\subseteq S$ of cardinality $\kappa$ which is \emph{homogeneous} for $f$, meaning that $f\upharpoonright[H]^n$ is constant for each $n<\omega$. Baumgartner proved \cite{MR0384553} that if $\kappa$ is a Ramsey cardinal, then the collection of non-Ramsey subsets of $\kappa$ is a normal ideal on $\kappa$. Sharpe and Welch \cite{MR2817562}, and independently Bagaria \cite{MR3894041}, extended the notion of $\Pi^1_n$-indescribability where $n<\omega$ to that of $\Pi^1_\xi$-indescribability where $\xi\geq\omega$. We study large cardinal properties and ideals which result from Ramseyness properties in which homogeneous sets are demanded to be $\Pi^1_\xi$-indescribable. By iterating Feng's Ramsey operator \cite{MR1077260} on the various $\Pi^1_\xi$-indescribability ideals, we obtain new large cardinal hierarchies and corresponding nonlinear increasing hierarchies of normal ideals. We provide a complete account of the containment relationships between the resulting ideals and show that the corresponding large cardinal properties yield a strict linear refinement of Feng's original Ramsey hierarchy. We also show that, given any ordinals $\beta_0,\beta_1<\kappa$ the increasing chains of ideals obtained by iterating the Ramsey operator on the $\Pi^1_{\beta_0}$-indescribability ideal and the $\Pi^1_{\beta_1}$-indescribability ideal respectively, are eventually equal; moreover, we identify the least degree of Ramseyness at which this equality occurs. As an application of our results we show that one can characterize our new large cardinal notions and the corresponding ideals in terms of generic elementary embeddings; as a special case this yields generic embedding characterizations of $\Pi^1_\xi$-indescribability and Ramseyness.

Explore related subjects

Keep this discovery

BibTeXRIS

Brent Cody. 2019-07-31. A refinement of the Ramsey hierarchy via indescribability. https://doi.org/10.1017/jsl.2019.94

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