Finitely generated groups are universal among finitely generated structures

DOI10.1016/J.APAL.2020.102855zbMATH Open1498.03081arXiv1712.00469OpenAlexW3039201404MaRDI QIDQ2003917FDOQ2003917

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)

Abstract: Universality has been an important concept in computable structure theory. A class $mathcalC$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $mathcalC$ with the same computability-theoretic properties as the given structure. Many classes such as graphs, groups, and fields are known to be universal. This paper is about the class of finitely generated groups. Because finitely generated structures are relatively simple, the class of finitely generated groups has no hope of being universal. We show that finitely generated groups are as universal as possible, given that they are finitely generated: for every finitely generated structure, there is a finitely generated group which has the same computability-theoretic properties. The same is not true for finitely generated fields. We apply the results of this investigation to quasi Scott sentences.

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

zbMATH Keywords

small cancellation theoryuniversalityfinitely generated structures

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS
• Universally generic finitely generated ordered Abelian groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003917)