Enumerations and completely decomposable torsion-free abelian groups

DOI10.1007/S00224-009-9175-9zbMath1204.03039OpenAlexW2083738367MaRDI QIDQ733745

Alexander G. Melnikov

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9175-9

zbMATH Keywords

torsion-free abelian groupscomputable modelsdegree spectra

Mathematics Subject Classification ID

Torsion-free groups, infinite rank (20K20) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (11)

New degree spectra of Polish spaces ⋮ Effectively categorical abelian groups ⋮ Computable completely decomposable groups ⋮ Degrees of orders on torsion-free abelian groups ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Some Questions in Computable Mathematics ⋮ Jump degrees of torsion-free abelian groups ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Degree spectra of structures ⋮ Limitwise monotonic sequences and degree spectra of structures ⋮ Decomposability and computability

Cites Work

• Abelian groups without elements of finite order
• The -spectrum of a linear order
• Every Set has a Least Jump Enumeration
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Arithmetical Reducibilities I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerations and completely decomposable torsion-free abelian groups