Enumerations and completely decomposable torsion-free abelian groups
From MaRDI portal
Publication:733745
DOI10.1007/S00224-009-9175-9zbMATH Open1204.03039OpenAlexW2083738367MaRDI QIDQ733745FDOQ733745
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
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Torsion-free groups, infinite rank (20K20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Abelian groups without elements of finite order
- Arithmetical Reducibilities I
- Title not available (Why is that?)
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- The \(\Delta_2^0\)-spectrum of a linear order
- Every Set has a Least Jump Enumeration
Cited In (13)
- New degree spectra of Polish spaces
- Computable completely decomposable groups
- Some Questions in Computable Mathematics
- COMPUTABLY COMPACT METRIC SPACES
- Computable abelian groups
- Jump degrees of torsion-free abelian groups
- Title not available (Why is that?)
- Degree spectra of structures
- Effectively categorical abelian groups
- Limitwise monotonic sequences and degree spectra of structures
- Every Set has a Least Jump Enumeration
- Degrees of orders on torsion-free abelian groups
- Decomposability and computability
Recommendations
This page was built for publication: Enumerations and completely decomposable torsion-free abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733745)
