Criteria of constructibility for real numbers
From MaRDI portal
Publication:5824361
DOI10.2307/2266321zbMath0052.25101OpenAlexW1985920135MaRDI QIDQ5824361
Publication date: 1953
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2266321
Related Items (11)
PCF extended with real numbers ⋮ Note on a system of myhill ⋮ Computational complexity of real functions ⋮ Bibliography of John Myhill ⋮ Primitive Recursiveness of Real Numbers under Different Representations ⋮ Classification of the Computable Approximations by Divergence Boundings ⋮ Probabilistic Recursive Functions ⋮ On the hierarchies of Δ20-real numbers ⋮ Classification of computably approximable real numbers ⋮ Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I ⋮ Computability of Real Numbers
Cites Work
This page was built for publication: Criteria of constructibility for real numbers
