Computable Scott sentences for quasi-Hopfian finitely presented structures
From MaRDI portal
Publication:2700812
DOI10.1007/s00153-022-00833-7OpenAlexW3093929872MaRDI QIDQ2700812
Publication date: 27 April 2023
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.13167
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of the isomorphism problem for computable free projective planes of finite rank
- On the automorphisms of a graph product of Abelian groups.
- On freely generated projective planes
- Scott sentences for certain groups
- Homomorphisms of free planes
- Describing free groups
- Describing groups
- Combinatorics of Coxeter Groups
- On optimal Scott sentences of finitely generated algebraic structures
- The Collineation Groups of Free Planes
- Intrinsic reflections and strongly rigid Coxeter groups
- A Generating Set for the Automorphism Group of a Graph Group
- Complexity of Scott sentences
- The Collineation Groups of Free Planes. II: A Presentation for the Group G 2
- Computable Algebra, General Theory and Theory of Computable Fields
- Projective Planes
This page was built for publication: Computable Scott sentences for quasi-Hopfian finitely presented structures
