Computable Scott Sentences for Quasi-Hopfian Finitely Presented Structures

preprint2022arXivOpen access

Abstract

We prove that every quasi-Hopfian finitely presented structure AA has a dd-Σ2Σ_2 Scott sentence, and that if in addition AA is computable and Aut(A)Aut(A) satisfies a natural computable condition, then AA has a computable dd-Σ2Σ_2 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 dd-Σ2Σ_2 Scott sentences. In particular, we show that every right-angled Coxeter group of finite rank has a computable dd-Σ2Σ_2 Scott sentence, as well as any strongly rigid Coxeter group of finite rank. Finally, we show that the free projective plane of rank 44 has a computable dd-Σ2Σ_2 Scott sentence, thus exhibiting a natural example where the assumption of quasi-Hopfianity is used (since this structure is not Hopfian).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.