Computably Enumerable Reals and Uniformly Presentable Ideals

DOI10.1002/1521-3870(200210)48:1+%3C29::AID-MALQ29%3E3.0.CO;2-OMaRDI QIDQ4787854zbMATH OpenOpenAlexFDO

Authors Sebastiaan A. Terwijn, Rodney G. Downey

Publication date 3 April 2003

Full work available at URL https://doi.org/10.1002/1521-3870(200210)48:1+%3C29::aid-malq29%3E3.0.co;2-o

zbMATH Keywords

\(\Sigma_3^0\)-idealcomputably enumerable realspresentationswtt-degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Constructive and recursive analysis (03F60) Constructive real analysis (26E40)

Recommendations

• scientific article; zbMATH DE number 1796998
• Approximation representations for reals and their wtt‐degrees
• scientific article; zbMATH DE number 1405572
• Upper bounds on ideals in the computably enumerable Turing degrees
• Degrees of d. c. e. reals

Cited in

(9)

• Presentations of computably enumerable reals.
• A Note on the Differences of Computably Enumerable Reals
• Approximation representations for reals and their wtt‐degrees
• scientific article; zbMATH DE number 1796998 (Why is no real title available?)
• Regular reals
• Minimal weak truth table degrees and computably enumerable Turing degrees
• Relatively computably enumerable reals
• Effectively infinite classes of numberings of computable families of reals
• Upper bounds on ideals in the computably enumerable Turing degrees

This page was built for publication: Computably Enumerable Reals and Uniformly Presentable Ideals

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