Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.20120

La logique continue des corps globalement valu\'es

Antoine Chambert-Loir
View original source ↗Read source document ↗Export metadata ↓

Abstract

The continuous logic of globally valued fields -- A globally valued field is a field endowed with a family of absolute values that satisfy a product formula. Number fields and function fields in one variable give classical and fundamental examples; Nevanlinna theory also gives rise to such structures on the field of meromorphic functions on $\mathbf C$. These globally valued fields can be studied in the context of continuous logic (for which the predicates are real valued), and such a study has been undertaken some 10 years ago by Ben Yaacov and Hrushovski, thus providing a model-theoretic framework for the diophantine theory of heights. One of the first fundamental results in the tehory states the the field of algebraic numbers, with its essentially unique structure of a globally valued field, is existentially closed: every system involving polynomial equalities and inequalities, as well as strict inequalities in heights, possesses a solution in algebraic numbers as soon as it possesses some solution in a globally valued extension. The proof, due to Szachniewicz, is inspired by the proof proposed by Ben Yaacov and Hrushovski in the case of function fields: the latter used in a crucial way the description by Boucksom, Demailly, P\u aun and Peternell of the cone of mobile curves in a complex projective variety, the case of number fields relies on recent results in Arakelov geometry.

Explore related subjects

math.LOmath.AG

Keep this discovery

BibTeXRIS

Antoine Chambert-Loir. 2025-06-25. La logique continue des corps globalement valu\'es. https://arxiv.org/abs/2506.20120

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↗