Computable fields and the bounded Turing reduction
From MaRDI portal
Publication:408170
DOI10.1016/j.apal.2011.11.007zbMath1250.03057OpenAlexW1978583361MaRDI QIDQ408170
Publication date: 29 March 2012
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2011.11.007
computability\(\mathrm {m}\)-reductionbounded Turing reductioncomputable fieldcomputable model theory
Algebraic field extensions (12F05) Separable extensions, Galois theory (12F10) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57)
Related Items
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Computable procedures for fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Is it harder to factor a polynomial or to find a root?
- Effective procedures in field theory
- Computable Fields and Weak Truth-Table Reducibility
- d-computable categoricity for algebraic fields
- Computable Algebra, General Theory and Theory of Computable Fields