Computable completely decomposable groups
From MaRDI portal
Recommendations
Cites work
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- A Class of Torsion-Free Abelian Groups of Finite Rank
- Abelian Group Theory and Related Topics
- Abelian groups without elements of finite order
- Back and forth relations for reduced abelian p-groups
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable ordered abelian groups and fields
- Computable structures and the hyperarithmetical hierarchy
- Decidability and computability of certain torsion-free abelian groups
- Degrees of orders on torsion-free abelian groups
- Effective content of field theory
- Effective procedures in field theory
- Effectively categorical abelian groups
- Effectively completely decomposable Abelian groups.
- Enumerations and completely decomposable torsion-free abelian groups
- Finite rank torsion free Abelian groups and rings
- Handbook of algebra. Volume 2
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- scientific article; zbMATH DE number 1303204 (Why is no real title available?)
- scientific article; zbMATH DE number 1048041 (Why is no real title available?)
- scientific article; zbMATH DE number 1936723 (Why is no real title available?)
- scientific article; zbMATH DE number 1531924 (Why is no real title available?)
- scientific article; zbMATH DE number 3805536 (Why is no real title available?)
- scientific article; zbMATH DE number 1450823 (Why is no real title available?)
- scientific article; zbMATH DE number 3332554 (Why is no real title available?)
- scientific article; zbMATH DE number 3406215 (Why is no real title available?)
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- Limitwise monotonic sequences and degree spectra of structures
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- The isomorphism problem for torsion-free abelian groups is analytic complete
Cited in
(26)- Effectively completely decomposable Abelian groups.
- Categoricity spectra of computable structures
- Decomposability and computability
- Computable topological abelian groups
- Enumerating abelian \(p\)-groups
- Categorical linearly ordered structures
- On \(\Delta_2^0\)-categoricity of equivalence relations
- Effectively categorical abelian groups
- Computable abelian groups
- Abelian p-groups and the halting problem
- \(\mathbf 0\)-categorical completely decomposable torsion-free abelian groups
- Degrees of orders on torsion-free abelian groups
- scientific article; zbMATH DE number 1936723 (Why is no real title available?)
- Torsion-free abelian groups with optimal Scott families
- A Friedberg enumeration of equivalence structures
- Independence in computable algebra
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Decompositions of decidable abelian groups
- The decomposability problem for torsion-free abelian groups is analytic-complete
- On Completely Decomposable Groups
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
- The complexity of decomposability of computable rings
- Computable formal contexts
- Computable classifications of continuous, transducer, and regular functions
- Enumerations and completely decomposable torsion-free abelian groups
This page was built for publication: Computable completely decomposable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3190417)
