Recursion Theory and Dedekind Cuts
From MaRDI portal
Publication:5571698
DOI10.2307/1995137zbMath0181.30503OpenAlexW4235948263MaRDI QIDQ5571698
Publication date: 1969
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1995137
Related Items (18)
Randomness and reducibility ⋮ Natural halting probabilities, partial randomness, and zeta functions ⋮ Relationships Between Reducibilities ⋮ On the hierarchy and extension of monotonically computable real numbers. ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ On 0′-computable reals ⋮ The irrationality exponents of computable numbers ⋮ On the hierarchies of Δ20-real numbers ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ \(\delta\)-uniform BSS machines ⋮ The Turing closure of an Archimedean field ⋮ Equality is a jump ⋮ Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I ⋮ Reducibilities on real numbers ⋮ Probabilistic Turing machines and recursively enumerable Dedekind cuts ⋮ Computability of Real Numbers ⋮ The closure properties on real numbers under limits and computable operators. ⋮ Presentations of computably enumerable reals.
This page was built for publication: Recursion Theory and Dedekind Cuts
