Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable

DOI10.2307/2160343zbMath0783.03026OpenAlexW4253709604MaRDI QIDQ5288071

Robert Byerly

Publication date: 23 August 1993

Full work available at URL: https://doi.org/10.2307/2160343

zbMATH Keywords

ordered ringscomputability over the realsfinite transcendence degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets
• The Irrationals are not Recursively Enumerable
• Alfred Tarski's elimination theory for real closed fields
• A note on computable real fields
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable