We prove that if A is a computable Hopfian finitely presented structure, then A has a computable d-Sigma 2 Scott sentence if and only if the weak Whitehead problem for A is decidable. We use this to infer that every hyperbolic group as well as any polycyclic-by-finite group has a computable d-Sigma 2 Scott sentence, thus covering two main classes of finitely presented groups. Our proof also implies that every weakly Hopfian finitely presented group is strongly defined by its there exists+-types, a question which arose in a different context. (c) 2024 Elsevier B.V. All rights reserved.
Computable Scott sentences and the weak Whitehead problem for finitely presented groups
Gianluca Paolini
2024-01-01
Abstract
We prove that if A is a computable Hopfian finitely presented structure, then A has a computable d-Sigma 2 Scott sentence if and only if the weak Whitehead problem for A is decidable. We use this to infer that every hyperbolic group as well as any polycyclic-by-finite group has a computable d-Sigma 2 Scott sentence, thus covering two main classes of finitely presented groups. Our proof also implies that every weakly Hopfian finitely presented group is strongly defined by its there exists+-types, a question which arose in a different context. (c) 2024 Elsevier B.V. All rights reserved.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
