SearcharxivSearch

arXiv · 2603.09711

Locally $\aleph_0$-categorical theories and locally Roelcke precompact groups

Abstract

It is well-known that Polish Roelcke precompact groups are the groups that can be represented as automorphism groups of $\aleph_0$-categorical structures in continuous logic and that there is a precise correspondence between properties of the group and properties of the structure. The goal of this paper is to extend this correspondence to the classes of locally Roelcke precompact groups and locally $\aleph_0$-categorical structures, the latter of which we define here. We characterise locally Roelcke precompact groups in terms of their isometric actions. We define locally $\aleph_0$-categorical theories and structures, prove an appropriate version of the Ryll-Nardzewski theorem, and identify the Polish locally Roelcke precompact groups as the automorphism groups of such structures. In all locally $\aleph_0$-categorical structures, there is a definable metric, which we call localising, and which captures the coarse geometric structure of the corresponding automorphism group. We show that two locally $\aleph_0$-categorical structures are bi-interpretable if and only if their automorphism groups are isomorphic. Finally, we show that (the unit ball of) a Banach space is $\aleph_0$-categorical if and only if the corresponding affine space is locally $\aleph_0$-categorical (as a metric space).

Explore related subjects

Keep this discovery

BibTeXRIS

Itaï Ben Yaacov, Todor Tsankov. 2026-03-10. Locally $\aleph_0$-categorical theories and locally Roelcke precompact groups. https://arxiv.org/abs/2603.09711

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