Turing degrees of nonabelian groups
From MaRDI portal
Publication:5295123
DOI10.1090/S0002-9939-07-08845-4zbMath1124.03015MaRDI QIDQ5295123
Malgorzata A. Dabkowska, Adam S. Sikora, Mieczysław K. Dabkowski, Valentina S. Harizanov
Publication date: 27 July 2007
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of the Burnside problem for exponent six
- Classical recursion theory. Vol. II
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- Path integral quantisation of the open strings normal modes
- Every Set has a Least Jump Enumeration
- Computable trees, prime models, and relative decidability
- Jumps of Orderings
- Degrees coded in jumps of orderings
- Orderings with αth Jump Degree 0 (α)
- On the Burnside problem on periodic groups
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- Computability-Theoretic Complexity of Countable Structures
- Degrees of Structures
- Sequences of n-diagrams
- Turing degrees of isomorphism types of algebraic objects
- Computable Algebra, General Theory and Theory of Computable Fields
This page was built for publication: Turing degrees of nonabelian groups