Showing 2024Show all
2 papers · 1 filter
math.LO2024
The Isomorphism Problem for Oligomorphic Groups with Weak Elimination of Imaginaries
Gianluca Paolini
In [21] it was asked if equality on the reals is sharp as a lower bound for the complexity of topological isomorphism between oligomorphic groups. We prove that under the assumptio…
math.LO2024
Computable Scott sentences and the weak Whitehead problem for finitely presented groups
Gianluca Paolini
We prove that if is a computable Hopfian finitely presented structure, then has a computable - Scott sentence if and only if the weak Whitehead problem for is d…