English
Related papers

Related papers: Procountable groups are not classifiable by counta…

200 papers

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

Logic · Mathematics 2025-08-13 Andrew Apps

We show that the topological conjugacy relation of diffeomorphisms on any manifold of dimension at least 2 is not classifiable by countable structures. This answers a question of Foreman and Gorodetski. We also prove that $E_0$ is reducible…

Dynamical Systems · Mathematics 2025-05-15 Bo Peng

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2007-05-23 Wesley Calvert

For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…

Logic · Mathematics 2018-11-20 Gianluca Paolini , Saharon Shelah

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

Logic · Mathematics 2025-11-25 Sy-David Friedman , Tapani Hyttinen , Vadim Kulikov

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

Logic · Mathematics 2025-05-13 Linus Richter

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…

Logic · Mathematics 2019-02-06 Samuel Coskey , Joel David Hamkins , Russell Miller

In this paper we further develop the theory of canonical approximations of Polishable subgroups of Polish groups, building on previous work of Solecki and Farah--Solecki. In particular, we obtain a characterization of such canonical…

Logic · Mathematics 2022-02-07 Martino Lupini

The group of automorphisms of the Cuntz algebra $\mathcal{O}_{2}$ is a Polish group with respect to the topology of pointwise convergence in norm. Our main result is that the relations of conjugacy and cocycle conjugacy of automorphisms of…

Operator Algebras · Mathematics 2018-01-08 Eusebio Gardella , Martino Lupini

We prove that no quantifier-free formula in the language of group theory can define the $\aleph_1$-half graph in a Polish group, thus generalising some results from [6]. We then pose some questions on the space of groups of automorphisms of…

Logic · Mathematics 2019-11-12 Gianluca Paolini , Saharon Shelah

We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…

Logic · Mathematics 2025-06-18 Pavel Gvozdevsky

We prove that the equivalence of pure states of a separable C*-algebra is either smooth or it continuously reduces $[0,1]^{\bbN}/\ell_2$ and it therefore cannot be classified by countable structures. The latter was independently proved by…

Operator Algebras · Mathematics 2010-02-01 Ilijas Farah

For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We…

Logic · Mathematics 2018-10-03 Ruiyuan Chen , Alexander S. Kechris

Let $\mathrm{XY_{L,T}}$ denote the class of countably infinite $L$-structures that satisfy the axioms $T$ and in which all homomorphisms of type X (these could be homomorphisms, monomorphisms, or isomorphisms) between finite substructures…

Combinatorics · Mathematics 2020-02-18 Andrés Aranda

We show that for any Polish group $G$ and any countable normal subgroup $\Gamma\triangleleft G$, the coset equivalence relation $G/\Gamma$ is a hyperfinite Borel equivalence relation. In particular, the outer automorphism group of any…

Group Theory · Mathematics 2020-02-24 Joshua Frisch , Forte Shinko

We show that the homeomorphisms of the Sierpi\'nski carpet are not classifiable, up to conjugacy, using isomorphism types of countable structures as invariants.

General Topology · Mathematics 2025-01-16 Dhruv Kulshreshtha , Aristotelis Panagiotopoulos

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

Logic · Mathematics 2016-04-01 Richard Rast

We show that the topology of pointwise convergence on scattered spaces is compatible with the group structure of their homeomorphism group. We then establish a few topological properties of the homeomorphism group of the first uncountable…

Group Theory · Mathematics 2020-12-02 Maxime Gheysens

We establish the Borel computability of various C$^*$-algebra invariants, including the Elliott invariant and the Cuntz semigroup. As applications we deduce that AF algebras are classifiable by countable structures, and that a conjecture of…

Operator Algebras · Mathematics 2015-03-13 Ilijas Farah , Andrew S. Toms , Asger Törnquist

Every permutation invariant Borel subset of the space of countable structures is definable in $\La_{\omega_1\omega}$ by a theorem of Lopez-Escobar. We prove variants of this theorem relative to fixed relations and fixed non-permutation…

Logic · Mathematics 2010-03-15 Fredrik Engström , Philipp Schlicht