Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2112.00651

Beautiful pairs

Pablo Cubides Kovacsics·Martin Hils·Jinhe Ye
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce an abstract framework to study certain classes of stably embedded pairs of models of a complete $\mathcal{L}$-theory $T$, called \textit{beautiful pairs}, which comprises Poizat's belles paires of stable structures and van den Dries-Lewenberg's tame pairs of o-minimal structures. Using an amalgamation construction, we relate several properties of beautiful pairs with properties analogous to properties in Fra\"{i}ss\'e classes. After characterizing beautiful pairs of various theories of ordered abelian groups and valued fields, including the theories of algebraically closed, $p$-adically closed and real closed valued fields, we show an Ax-Kochen-Ershov type result for beautiful pairs of henselian valued fields. As an application, we derive strict pro-definability of particular classes of definable types. When $T$ is one of the theories of valued fields mentioned above, the corresponding classes of types are related to classical geometric spaces and our main result specializes to their strict pro-definability. Most notably, we exhibit the strict pro-definability of a natural space of types associated to Huber's analytification. In this way, we also recover a result of Hrushovski-Loeser on the strict pro-definability of stably dominated types in algebraically closed valued fields, which corresponds to Berkovich's analytification.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Pablo Cubides Kovacsics, Martin Hils, Jinhe Ye. 2021-12-01. Beautiful pairs. https://arxiv.org/abs/2112.00651

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↗