Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers

Mathematical Logic Quarterly 48 (S1):91-106 (2002)
  Copy   BIBTEX

Abstract

Given a class ℱ oft otal functions in the set oft he natural numbers, one could study the real numbers that have arbitrarily close rational approximations explicitly expressible by means of functions from ℱ. We do this for classes ℱsatisfying certain closedness conditions. The conditions in question are satisfied for example by the class of all recursive functions, by the class of the primitive recursive ones, by any of the Grzegorczyk classes ℰnwith n ≥ 2, by the class of all functions recursive in a given function and by the class of the functions primitive recursive in it, as well as by the class of all total functions in the set of the natural numbers

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-01

Downloads
46 (#1,255,219)

6 months
11 (#1,088,005)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dimiter Skordev
Sofia University

Citations of this work

Continued fractions of primitive recursive real numbers.Ivan Georgiev - 2015 - Mathematical Logic Quarterly 61 (4-5):288-306.

Add more citations

References found in this work

Nicht konstruktiv beweisbare sätze der analysis.Ernst Specker - 1949 - Journal of Symbolic Logic 14 (3):145-158.
Recursive real numbers.A. H. Lachlan - 1963 - Journal of Symbolic Logic 28 (1):1-16.

Add more references