Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis

DOI10.1090/S0002-9947-2012-05458-4zbMath1325.03037OpenAlexW2108939266MaRDI QIDQ2844727

J. Wallbaum, Charles F. D. 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

index setfree groupscomputability-theoretic complexity

Mathematics Subject Classification ID

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

Related Items (11)

Effectively categorical abelian groups ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Orders on magmas and computability theory ⋮ Index sets and Scott sentences ⋮ Scott sentences for certain groups ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Scott sentences for equivalence structures ⋮ Describing free groups ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations

Cites Work

• Unnamed Item
• Test words, generic elements and almost primitivity
• Hyperbolicity of the complex of free factors.
• Describing free groups
• On Finitely Generated Subgroups of a Free Group

This page was built for publication: Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis