Scott sentences for certain groups
Julia Knight, Vikram Saraph

TL;DR
This paper constructs and analyzes Scott sentences for specific computable groups, demonstrating that these sentences can often be simplified to lower complexity forms, with results extending to finitely generated abelian groups and certain torsion-free groups.
Contribution
It extends the understanding of Scott sentences for computable groups, showing they can often be simplified to computable $d$-$\Sigma_2$ forms, including all finitely generated abelian groups and the infinite dihedral group.
Findings
All studied computable finitely generated groups have computable $\Sigma_3$ Scott sentences.
Some groups admit simpler computable $d$-$\Sigma_2$ Scott sentences.
For certain rank 1 torsion-free abelian groups, the $\Sigma_3$ Scott sentence is optimal.
Abstract
We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of finite rank. For both kinds of groups, the computable ones all have computable Scott sentences. Sometimes we can do better. In fact, the computable finitely generated groups that we have studied all have Scott sentences that are "computable -" (the conjunction of a computable sentence and a computable sentence). This was already shown for the finitely generated free groups. Here we show it for all finitely generated abelian groups, and for the infinite dihedral group. Among the computable torsion-free abelian groups of finite rank, we focus on those of rank . These are exactly the additive subgroups of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
