2000 character limit reached
Automorphism Groups of Countable Stable Structures (1712.02568v3)
Published 7 Dec 2017 in math.LO
Abstract: 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 structure $M$ from the topological properties of the Polish group $Aut(M)$.