SearcharxivSearch

arXiv · 2410.00607

An introduction to higher walks

Abstract

The following is an introduction to the study of higher walks, by which we mean a family of higher-dimensional extensions of Todorcevic's method of walks on the ordinals. After a brief review of this method, including, for example, definitions of the classical functions $\mathrm{Tr}$ and $\rho_2$ induced by a choice of $C$-sequence, we record a shortlist of desiderata for such extensions, along with $(n+1)$-dimensional functions $\mathrm{Tr}_n$ and $\rho_2^n$ (induced by a choice of higher-dimensional $C$-sequence) which we show to satisfy the bulk of them. Much of the interest of these higher walks functions lies in their affinity, as in the classical $n=1$ case, for the ordinals $\omega_n$ (we show, for example, that $\rho^n_2$ determines both $n$-dimensional linear orderings and $n$-coherent families on $\omega_n$, and that higher walks define nontrivial elements of the $n^{\mathrm{th}}$ cohomology groups of $\omega_n$), and in the questions that they thereby raise both about the combinatorics of the latter and about higher-dimensional infinitary combinatorics more generally; we collect the most prominent of these questions in our conclusion. These objects are also, though, of a sufficient combinatorial richness to be of interest in their own right, as we have underscored via an extended study of the first genuine novelty among them, the function $\mathrm{Tr}_2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeffrey Bergfalk. 2024-10-01. An introduction to higher walks. https://arxiv.org/abs/2410.00607

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