On the hierarchies of Δ20-real numbers
From MaRDI portal
Publication:5444099
DOI10.1051/ita:2007008zbMath1155.03027OpenAlexW2053384789MaRDI QIDQ5444099
Publication date: 22 February 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2007__41_1_3_0
Constructive and recursive analysis (03F60) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical recursion theory. The theory of functions and sets of natural numbers
- Relatively recursive reals and real functions
- Classical recursion theory. Vol. II
- On the hierarchy and extension of monotonically computable real numbers.
- Effective Jordan decomposition
- Cohesive sets and recursively enumerable Dedekind cuts
- On a hierarchy of sets. III
- On the Divergence Bounded Computable Real Numbers
- Degrees of d. c. e. reals
- Weak computability and representation of reals
- On the Turing Degrees of Weakly Computable Real Numbers
- h-monotonically computable real numbers
- Computing and Combinatorics
- Recursion Theory and Dedekind Cuts
- Computability and Recursion
- Computing and Combinatorics
- New Computational Paradigms
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Nicht konstruktiv beweisbare Sätze der Analysis
- Criteria of constructibility for real numbers
- Recursive Real Numbers
- Weakly computable real numbers
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
This page was built for publication: On the hierarchies of Δ20-real numbers