Describing free groups

DOI10.1090/S0002-9947-2012-05456-0zbMath1302.03045OpenAlexW2031254612MaRDI QIDQ2844726

Karen Lange, C. Safranski, J. Wallbaum, S. Quinn, Charles F. D. McCoy, Julia F. Knight, Jacob Carson, Andrey S. Morozov, Valentina S. Harizanov

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-05456-0

zbMATH Keywords

free groupindex setinfinitary languagecomputability-theoretic complexity

Mathematics Subject Classification ID

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

Related Items (17)

Effectively categorical abelian groups ⋮ On optimal Scott sentences of finitely generated algebraic structures ⋮ 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 ⋮ Describing groups ⋮ Computable Scott sentences for quasi-Hopfian finitely presented structures ⋮ Complexity of 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 ⋮ Detecting properties from descriptions of groups ⋮ Scott sentences for equivalence structures ⋮ Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations ⋮ SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

Cites Work

• Elementary theory of free non-abelian groups.
• Computable structures and the hyperarithmetical hierarchy
• Combinatorial group theory.
• Hyperbolicity of the complex of free factors.
• Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basis
• Groupes stables, avec types génériques réguliers
• On the generic type of the free group
• Index sets of computable structures
• On genericity and weight in the free group
• Effective content of field theory

This page was built for publication: Describing free groups