A partition theorem for a large dense linear order

M. Dzamonja; J. Larson; W. Mitchell

Home/Archive/arXiv

arXiv · math/0506123

A partition theorem for a large dense linear order

M. Dzamonja·J. Larson·W. Mitchell

View original source ↗Read source document ↗Export metadata ↓

Abstract

Let Q_K=(Q,<_Q)$ be a strongly K-dense linear order of size K for a suitable cardinal K. We prove, for all integers m > 1 that there is a finite value t_m^+ such that the set of all m-tuples from Q can be divided into t_m^+ many classes, such that whenever any of these classes C is colored with fewer than K many colors, there is a copy Q* of Q_K such that all m-tuples from Q* in C receive the same color. As a consequence we obtain that whenever we color the m-tuples of Q with fewer than K many colors, there is a copy of Q_K all m-tuples from which are colored in at most t_m^+ colors. In other words, the partition relation Q_K -->(Q_K)^m_{ 2 we have t_m^+ > t_m, the m-th tangent number. The paper also contains similar partition results about K-Rado graphs. A consequence of our work and some earlier results of Hajnal and Komjath is that a theorem of Shelah known to follow from a large cardinal assumption in a generic extension, does not follow from any large cardinal assumption on its own.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

M. Dzamonja, J. Larson, W. Mitchell. 2005-06-07. A partition theorem for a large dense linear order. https://arxiv.org/abs/math/0506123

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗