Turing degrees of nonabelian groups
From MaRDI portal
Recommendations
Cites work
- Classical recursion theory. Vol. II
- Computability-Theoretic Complexity of Countable Structures
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable structures and the hyperarithmetical hierarchy
- Computable trees, prime models, and relative decidability
- Degree spectra and computable dimensions in algebraic structures
- Degrees coded in jumps of orderings
- Degrees of Structures
- Enumerations, countable structures and Turing degrees
- Every Set has a Least Jump Enumeration
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 1302870 (Why is no real title available?)
- scientific article; zbMATH DE number 1048041 (Why is no real title available?)
- scientific article; zbMATH DE number 2154082 (Why is no real title available?)
- scientific article; zbMATH DE number 3412857 (Why is no real title available?)
- scientific article; zbMATH DE number 3099373 (Why is no real title available?)
- Jumps of Orderings
- On the Burnside problem on periodic groups
- Orderings with αth Jump Degree 0 (α)
- Path integral quantisation of the open strings normal modes
- Relative to any nonrecursive set
- Sequences of n-diagrams
- Solution of the Burnside problem for exponent six
- Turing degrees of isomorphism types of algebraic objects
Cited in
(4)
This page was built for publication: Turing degrees of nonabelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295123)