Computable Scott Sentences for Quasi-Hopfian Finitely Presented Structures
Gianluca Paolini

TL;DR
This paper establishes that certain algebraic structures, including some Coxeter groups and the free projective plane, have computable $d$-$\Sigma_2$ Scott sentences, unifying and extending previous results in the field.
Contribution
It proves that all quasi-Hopfian finitely presented structures have $d$-$\Sigma_2$ Scott sentences and extends this to computable structures with specific automorphism conditions, applying to new algebraic examples.
Findings
Every right-angled Coxeter group of finite rank has a computable $d$-$\Sigma_2$ Scott sentence.
Every strongly rigid Coxeter group of finite rank has a computable $d$-$\Sigma_2$ Scott sentence.
The free projective plane of rank 4 has a computable $d$-$\Sigma_2$ Scott sentence.
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).
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.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Cellular Automata and Applications
