On Ramsey degrees, compactness and approximability

Dragan Mašulović

Home/Archive/arXiv

arXiv · 2406.02007

On Ramsey degrees, compactness and approximability

Dragan Mašulović

View original source ↗Read source document ↗Export metadata ↓

Abstract

One of the consequences of the Compactness Principle in structural Ramsey theory is that the small Ramsey degrees cannot exceed the corresponding big Ramsey degrees, thereby justifying the choice of adjectives. However, it is unclear what happens in the realm of dual Ramsey degrees due to the lack of the compactness argument that applies to that setting. In this paper we present a framework within which both "direct" and dual Ramsey statements can be stated and reasoned about in a uniform fashion. We introduce the notion of approximability which yields a general compactness argument powerful enough to prove statements about both "direct" and dual Ramsey phenomena. We conclude the paper with an application of the new strategies by generalizing Voigt's $\star$-version of the Infinite Ramsey Theorem to a large class of relational structures and deriving a Ramsey statement for "loose colorings" of enumerated Fra\"{\i}ss\'{e} limits.

Explore related subjects

math.LO math.CO

Keep this discovery

BibTeX RIS

Dragan Mašulović. 2024-06-04. On Ramsey degrees, compactness and approximability. https://arxiv.org/abs/2406.02007

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↗