Computable fields and the bounded Turing reduction

DOI10.1016/J.APAL.2011.11.007MaRDI QIDQ408170zbMATH OpenOpenAlexFDO

Authors Rebecca M. Steiner

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

zbMATH Keywords

computability\(\mathrm {m}\)-reductionbounded Turing reductioncomputable fieldcomputable model theory

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Computable structure theory, computable model theory (03C57) Algebraic field extensions (12F05) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Computable fields and weak truth-table reducibility
• Computability over arbitrary fields
• Computable fields and Galois theory
• scientific article; zbMATH DE number 1285742
• Computability and totality in domains
• Bounded reducibility for computable numberings
• BOUNDS IN THE TURING REDUCIBILITY OF FUNCTIONS
• Computable procedures for fields
• scientific article; zbMATH DE number 4021127
• Enumeration reducibility and computable structure theory

Cites work

• scientific article; zbMATH DE number 4014840 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3760283 (Why is no real title available?)
• scientific article; zbMATH DE number 1970438 (Why is no real title available?)
• scientific article; zbMATH DE number 3058859 (Why is no real title available?)
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable fields and weak truth-table reducibility
• Effective procedures in field theory
• Is it harder to factor a polynomial or to find a root?
• \(d\)-computable categoricity for algebraic fields

Cited in

(8)

• Computability and Beltrami fields in Euclidean space
• Bounded theories for polyspace computability
• Minimal weak truth table degrees and computably enumerable Turing degrees
• Computable fields and weak truth-table reducibility
• Adapting Rabin's theorem for differential fields
• On notions of computability-theoretic reduction between Π21 principles
• Computable procedures for fields
• Is it harder to factor a polynomial or to find a root?

This page was built for publication: Computable fields and the bounded Turing reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408170)