Describing groups

DOI10.1090/PROC/13458MaRDI QIDQ2964051zbMATH OpenOpenAlexFDO

Authors Meng-Che Ho

Publication date 22 February 2017

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) General structure theorems for groups (20E34) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Abstract: We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J. Knight et al. determined the complexity of index sets of various structures. In this paper, we focus on finding the complexity of computable Scott sentences and index sets of various groups, generalizing methods that was previously used by J. Knight et al. We found computable Scott sentences for various different groups or class of groups, including nilpotent groups, polycyclic groups, certain solvable groups, and certain subgroups of $mathbbQ$. In some of these cases, we also showed that the sentence we had are optimal. In the last section, we also give an example showing d-$Sigm{a}_{2}subsetneqDelt{a}_3$ in the complexity hierarchy of pseudo-Scott sentences, contrasting the result saying d-$Sigm{a}_2=Delt{a}_3$ in the complexity hierarchy of Scott sentences, which is related to the boldface Borel hierarchy.

Recommendations

• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• Index sets and Scott sentences
• Scott sentences for certain groups
• Complexity of Scott sentences
• Scott sentences for equivalence structures

Cites work

• Algebraic geometry over groups. I: Algebraic sets and ideal theory
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable structures and the hyperarithmetical hierarchy
• Convergence of Baumslag-Solitar groups.
• Describing free groups
• scientific article; zbMATH DE number 3762288 (Why is no real title available?)
• scientific article; zbMATH DE number 1564067 (Why is no real title available?)
• scientific article; zbMATH DE number 2146477 (Why is no real title available?)
• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• Index sets and Scott sentences
• Index sets of computable structures
• Invariant sets in topology and logic
• ON CO-HOPFIAN NILPOTENT GROUPS
• Scott sentences for certain groups
• The effective Borel hierarchy
• The Invariant ∏ 0 α Separation Principle

Cited in

(12)

• Scott sentences for certain groups
• Finitely generated groups are universal among finitely generated structures
• Computable Scott sentences for quasi-Hopfian finitely presented structures
• Describing free groups
• scientific article; zbMATH DE number 5848566 (Why is no real title available?)
• On optimal Scott sentences of finitely generated algebraic structures
• Index sets and Scott sentences
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• An introduction to the Scott complexity of countable structures and a survey of recent results
• Complexity of Scott sentences
• Computable Scott sentences and the weak Whitehead problem for finitely presented groups
• Scott complexity of reduced abelian p-groups

This page was built for publication: Describing groups

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