Computable scott sentences for quasi–Hopfian finitely presented structures

Archive for Mathematical Logic 62 (1):55-65 (2023)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2022-06-26

Downloads
12 (#1,092,892)

6 months
9 (#437,668)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Gianluca Paolini
University of Amsterdam

Citations of this work

Add more citations

References found in this work

Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.

Add more references