Skip to main content

Part of the book series: Synthese Library ((SYLI,volume 355))

  • 668 Accesses

Abstract

This chapter presents the logical framework for strict finitism. I will first present a logical formal system for strict finitism. Then, I will introduce a system of semi-formal notations to allow the presentation of the constructions and inferences in strict finitism in a simplified and more readable format. This will allow us to state ordinary mathematics in strict finitism in an informal way and make it look very similar to classical mathematics. This includes allowing us to talk about sets and functions in strict finitism, although we are not really committed to such entities.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Avigad, J., and S. Feferman. 1998. Gödel’s functional (“dialetica”) interpretation. In Handbook of proof theory, ed. S.R. Buss, 337–405. Amsterdam, The Netherlands: Elsevier.

    Chapter  Google Scholar 

  2. Barendregt, H.P. 1981. The Lambda Calculus, its syntax and semantics. Amsterdam: North-Holland.

    Google Scholar 

  3. Benacerraf, P. 1973. Mathematical truth. Journal of Philosophy 70:661–679. [Reprinted in Benacerraf, P., and H. Putnam. 1983. Philosophy of mathematics: Selected readings, 2nd ed. Cambridge: Cambridge University Press].

    Article  Google Scholar 

  4. Bishop, E. 1970. Mathematics as a numerical language. In Intuitionism and proof theory, eds. A. Kino, J. Myhill, and R.E. Vesley, 53–71. Amsterdam: North-Holland.

    Google Scholar 

  5. Bishop, E., and D.S. Bridges. 1985. Constructive analysis. New York: Springer.

    Book  Google Scholar 

  6. Murawski, R. 1999. Recursive functions and metamathematics. Dordrecht: Kluwer.

    Book  Google Scholar 

  7. Tait, W. 1981. Finitism. Journal of Philosophy 78:524–546.

    Article  Google Scholar 

  8. Troelstra, A.S. 1973. Metamathematical investigation of intuitionistic arithmetic and analysis. Lecture Notes in Mathematics, No. 344. Berlin: Springer.

    Book  Google Scholar 

  9. Troelstra, A.S. 1990. Introductory note to 1958 and 1972. In Kurt Gödel Collected works, volume II, ed. S. Feferman, et al. 217–239. Oxford: Oxford University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Feng Ye .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Ye, F. (2011). Strict Finitism. In: Strict Finitism and the Logic of Mathematical Applications. Synthese Library, vol 355. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1347-5_2

Download citation

Publish with us

Policies and ethics