paper

Computable Scott Sentences for Quasi-Hopfian Finitely Presented Structures

arXiv:2010.13167 · doi:10.1007/s00153-022-00833-7

Abstract

We prove that every quasi-Hopfian finitely presented structure has a - Scott sentence, and that if in addition is computable and satisfies a natural computable condition, then has a computable - Scott sentence. This unifies several known results on Scott sentences of finitely presented structures and it is used to prove that other not previously considered algebraic structures of interest have computable - Scott sentences. In particular, we show that every right-angled Coxeter group of finite rank has a computable - Scott sentence, as well as any strongly rigid Coxeter group of finite rank. Finally, we show that the free projective plane of rank has a computable - Scott sentence, thus exhibiting a natural example where the assumption of quasi-Hopfianity is used (since this structure is not Hopfian).

arXiv comment10 pages