Groundwork for weak analysis

Journal of Symbolic Logic 67 (2):557-578 (2002)
  Copy   BIBTEX

Abstract

This paper develops the very basic notions of analysis in a weak second-order theory of arithmetic BTFA whose provably total functions are the polynomial time computable functions. We formalize within BTFA the real number system and the notion of a continuous real function of a real variable. The theory BTFA is able to prove the intermediate value theorem, wherefore it follows that the system of real numbers is a real closed ordered field. In the last section of the paper, we show how to interpret the theory BTFA in Robinson's theory of arithmetic Q. This fact entails that the elementary theory of the real closed ordered fields is interpretable in Q

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
94 (#179,520)

6 months
14 (#170,561)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 2003 - Bulletin of Symbolic Logic 9 (4):520-521.
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1952 - Journal of Symbolic Logic 17 (3):207-207.
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1949 - Journal of Symbolic Logic 14 (3):188-188.
Predicative arithmetic.Edward Nelson - 1986 - Princeton, N.J.: Princeton University Press.

View all 15 references / Add more references