Relativization of Real Numbers to a Universe
We discuss a relativization of real numbers to a universe given by a function algebra, and develop a tentative theory of relativized real numbers. We show that the class R(Ϝptime) of real numbers, obtained by relativizing to the class F Ptime of polynomial time computable functions, is a proper subclass of the class R(ε) of real numbers, obtained by relativizing to the class ε of elementary functions. We show the Cauchy completeness of relativized real numbers, and that we can prove the (constructive or approximate) intermediate value theorem if our universe is closed under a closure condition used to characterize the polynomial time computable functions.
Unable to display preview. Download preview PDF.
- 1.Errett Bishop, Foundations of Constructive Mathematics, McGraw-Hill, New York, 1967.Google Scholar
- 3.Peter Clote, Computational models and functional algebras, In E.R. Griffor ed., Handbook of Computability Theory, North-Holland, Amsterdam, 1999.Google Scholar
- 4.Alan Cobham, The intrinsic computational difficulty of functions, In Y. Bar-Hillel ed., Logic, Methodology and Philosophy of Science II, North-Holland, Amsterdam, 24–30, 1965.Google Scholar
- 8.Hajime Ishihara, Constructive reverse mathematics: compactness properties, In L. Crosilla and P. Schuster eds., From Sets and Types to Analysis and Topology: Towards Practicable Foundations for Constructive Mathematics, Oxford University Press, Oxford, 245–267, 2005.Google Scholar
- 14.Harvey E. Rose, Subrecursion: Functions and Hierarchies, Oxford University Press, Oxford, 1984.Google Scholar
- 15.Anne S. Troelstra and Dirk van Dalen, Constructivism in Mathematics, Vol. I. An Introduction, North-Holland, Amsterdam, 1988.Google Scholar