Cohesive sets and recursively enumerable Dedekind cuts
From MaRDI portal
Publication:2531924
DOI10.2140/pjm.1969.31.215zbMath0172.00902OpenAlexW2059288245MaRDI QIDQ2531924
Publication date: 1969
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1969.31.215
Related Items
Randomness and reducibility ⋮ A hierarchy of Turing degrees of divergence bounded computable real numbers ⋮ Closed left-r.e. sets ⋮ On the hierarchy and extension of monotonically computable real numbers. ⋮ Closed Left-R.E. Sets ⋮ Unnamed Item ⋮ Weakly computable real numbers ⋮ Regular reals ⋮ On the hierarchies of Δ20-real numbers ⋮ Classification of computably approximable real numbers ⋮ Asymptotic density and the Ershov hierarchy ⋮ Probabilistic Turing machines and recursively enumerable Dedekind cuts ⋮ The closure properties on real numbers under limits and computable operators. ⋮ Presentations of computably enumerable reals. ⋮ Divergence bounded computable real numbers