Describing free groups. II: ^0_4 hardness and no _2⁰ basis

DOI10.1090/S0002-9947-2012-05458-4MaRDI QIDQ2844727zbMATH OpenOpenAlexFDO

Authors John Wallbaum, Charles McCoy

Publication date 19 August 2013

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

Full work available at URL https://doi.org/10.1090/s0002-9947-2012-05458-4

zbMATH Keywords

computability-theoretic complexityfree groupsindex set

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other infinitary logic (03C75) Complexity of computation (including implicit computational complexity) (03D15) Free nonabelian groups (20E05)

Review text

For definitions and notations see Part I [\textit{J. Carson} et al., Trans. Am. Math. Soc. 364, No. 11, 5715--5728 (2012; Zbl 1302.03045)]. The study of free groups from a computability-theoretic point of view is continued. It is shown that the descriptions for \(F_\infty\) given in the first part are the best possible. Namely it is proved that \(I(F_\infty)\) and \(I(\mathrm{FrGr})\) are \(m\)-complete \(\Pi^0_4\) and there is a computable copy \(F\) of \(F_\infty\) with no \(\Sigma^0_2\) basis.

Recommendations

• Free groups, the 𝑇-property, and 𝐼𝐼₁-factors with different countable fundamental groups
• scientific article; zbMATH DE number 3916533
• scientific article; zbMATH DE number 3967132
• \(S_{2}\) and the Fréchet property of free topological groups
• Free groups and semigroups in N
• On the weak \(\pi \)-potency of some groups and free products
• Free groups and quasidiagonality
• On free p-compact groups
• ON WEAKLY DISTINGUISHED BASES AND FREE GENERATING SETS OF FREE GROUPS
• scientific article; zbMATH DE number 565932

Cites work

• Describing free groups
• scientific article; zbMATH DE number 3061622 (Why is no real title available?)
• Hyperbolicity of the complex of free factors.
• On Finitely Generated Subgroups of a Free Group
• Test words, generic elements and almost primitivity

Cited in

(13)

• Scott sentences for certain groups
• Descriptive complexity of subsets of the space of finitely generated groups
• Using computability to measure complexity of algebraic structures and classes of structures
• Scott sentences for equivalence structures
• On \(\Delta_2^0\)-categoricity of equivalence relations
• Effectively categorical abelian groups
• Describing free groups
• Index sets and Scott sentences
• Orders on magmas and computability theory
• Finding bases of uncountable free abelian groups is usually difficult
• An introduction to the Scott complexity of countable structures and a survey of recent results
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES

This page was built for publication: Describing free groups. II: \(\Pi ^{0}_{4}\) hardness and no \(\Sigma _{2}^{0}\) basis

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