Computable Fields and Weak Truth-Table Reducibility

DOI10.1007/978-3-642-13962-8_44zbMath1286.03129MaRDI QIDQ3576228

Rebecca M. Steiner

Publication date: 29 July 2010

Published in: Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13962-8_44

Mathematics Subject Classification ID

03D30: Other degrees and reducibilities in computability and recursion theory

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

Related Items

Computing constraint sets for differential fields, Computable fields and the bounded Turing reduction, Adapting Rabin’s Theorem for Differential Fields