SearcharxivSearch

arXiv · 2605.19513

Trace definability IV: higher arity notions

Abstract

Motivated by the "composition theorems" of Chernikov-Hempel and Abd Aldaim-Conant-Terry we introduce $k$-trace definability between first order theories. Any theory which is $k$-trace definable in a NIP theory is $k$-NIP and any theory which is $2$-trace definable in a stable theory is $2$-NFOP. All known examples of $k$-NIP theories are $k$-trace definable in NIP theories. We show that for several of the main examples of $k$-NIP theories $T$ there is a NIP theory $T^*$ such that $T$ is the (unique up to a certain notion of equivalence) universal theory which is $k$-trace definable in $T^*$. For example the theory of Hilbert space is the universal theory which is $2$-trace definable in RCF, the theory of the generic class $k$ nilpotent Lie algebra over $\mathbb{F}_p$ is the universal theory which is $k$-trace definable in the theory of infinite $\mathbb{F}_p$-vector spaces, the theory of the generic $k$-hypergraph is the universal theory which is $k$-trace definable in the theory of a set with two elements, and the theory of Uryshon space is the universal theory which is $2$-trace definable in the theory of $(\mathbb{R}; +, <)$. We construct the universal theory $D_k(T)$ which is $k$-trace definable in an arbitrary theory $T$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erik Walsberg. 2026-05-19. Trace definability IV: higher arity notions. https://arxiv.org/abs/2605.19513

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