Finitely generated groups are universal among finitely generated structures

DOI10.1016/j.apal.2020.102855zbMath1498.03081arXiv1712.00469OpenAlexW3039201404MaRDI QIDQ2003917

Meng-Che ``Turbo Ho, Matthew Harrison-Trainor

Publication date: 13 October 2020

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.00469

zbMATH Keywords

universalitysmall cancellation theoryfinitely generated structures

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Cancellation theory of groups; application of van Kampen diagrams (20F06) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS

Cites Work

• Unnamed Item
• Unnamed Item
• Quasi finitely axiomatizable totally categorical theories
• Combinatorial group theory.
• Degree spectra and computable dimensions in algebraic structures
• Scott sentences for certain groups
• Describing groups
• Separating Classes of Groups by First-Order Sentences
• On optimal Scott sentences of finitely generated algebraic structures
• A robuster Scott rank
• Describing Groups
• Index sets of computable structures
• The Invariant ∏ 0 α Separation Principle
• There is no classification of the decidably presentable structures
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
• Model Theory
• Complexity of Scott sentences
• A fixed point for the jump operator on structures
• Turing computable embeddings
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY

This page was built for publication: Finitely generated groups are universal among finitely generated structures