Computable Fields and Weak Truth-Table Reducibility

DOI10.1007/978-3-642-13962-8_44zbMath1286.03129OpenAlexW1578101863MaRDI 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

Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

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

This page was built for publication: Computable Fields and Weak Truth-Table Reducibility