Skip to main content

Aspects of Mathematical Experience

  • Chapter
  • First Online:
Philosophy of Mathematics Today

Part of the book series: Episteme ((EPIS,volume 22))

Abstract

In the current discussion on philosophy of mathematics some do as if systematic foundational work supported an exclusive alternative between Platonism and Constructivism; others do as if such mathematical and logical research were deeply misguided and had no bearing on our understanding of mathematics. Both attitudes prevent us from grasping insights that underlie such work and from appreciating significant results that have been obtained. In consequence, they keep us from turning attention to the task of understanding the role of accessible domains for foundational theories and that of abstract structures for mathematical practice.

My considerations are based on two papers of mine: the first, “Relative Consistency and Accessible Domains”, was published in Synthese 84, 1990, pp. 259–297; the second, “Mechanical Procedures and Mathematical Experience”, appeared in Mathematics and Mind, edited by A. George, Oxford University Press, 1994, pp. 71–117. Here, I focus squarely on broader strategic points and rely for details concerning the relevant (meta-)mathematical results, historical connections, and conceptual analyses on those earlier papers.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aczel, P. [1977] An introduction to inductive definitions, in: J. Barwise, ed., Handbook of Mathematical Logic, Amsterdam, 739–782.

    Google Scholar 

  • Bernays, P. [1922] Über Hilberts Gedanken zur Grundlegung der Arithmetik, Jahresberichte DMV, 31,10–19.

    MATH  Google Scholar 

  • Bernays, P. [1922A] Hilberts Bedeutung für die Philosophie der Mathematik, Die Naturwissenschaften, 4,93–99.

    Article  Google Scholar 

  • Bernays, P. [1930] Die Philosophie der Mathematik und die Hilbertsche Beweistheorie, in: (Bernays, 1976), 17–61.

    MATH  Google Scholar 

  • Bernays, P. [1950] Mathematische Existenz und Widerspruchsfreiheit, in: (Bernays, 1976), 92–106.

    MATH  Google Scholar 

  • Bernays, P. [1970] Die Schematische Korrespondenz und die Idealisierten Strukturen, in: (Bernays, 1976), 176–188.

    MATH  Google Scholar 

  • Bernays, P. [1976] Abhandlungen zur Philosophie der Mathematik, Darmstadt: Wissenschaftliche Buchgesellschaft.

    MATH  Google Scholar 

  • Bourbaki, N. [1950] The architecture of mathematics, Mathematical Monthly, 57, 221–232.

    Article  MathSciNet  Google Scholar 

  • Brouwer, L. E. J. [1927] Über Definitionsbereiche von Funktionen, Mathematische Annalen, 97, 60–75; in: (van Heijenoort, 1967), 446–463.

    Article  MathSciNet  Google Scholar 

  • Buchholz, W., Feferman, S., Pohlers, W. Sieg, W. [1981] Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-theoretical Studies, Berlin/Heidelberg/New York: Springer Lecture Notes in Mathematics, 897.

    Book  Google Scholar 

  • Davis, M. [1965] The Undecidable, New York.

    Google Scholar 

  • Feferman, S. [1969] Set-theoretical foundations of category theory (with an appendix by G. Kreisel); in: Reports of the Midwest Category Seminar, III, Berlin/Heidelberg/New York: Springer Lecture Notes in Mathematics, 106, 201–247.

    Chapter  Google Scholar 

  • Feferman, S. [1977] Theories of finite type related to mathematical practice, in: J. Barwise, ed., Handbook of Mathematical Logic, Amsterdam, 913–971.

    Google Scholar 

  • Feferman, S. [1988] Hilbert’s program relativized: proof-theoretical and foundational reductions, Journal of Symbolic Logic, 53(2), 364–384.

    MathSciNet  MATH  Google Scholar 

  • Feferman, S. [1994] Introductory note to (Gödel, 1933), to appear in: Collected Works III, 36–44.

    Google Scholar 

  • Feferman, S. und Sieg, W. [1981] Iterated inductive definitions and subsystems of analysis, in: Feferman, S., Pohlers, W. Sieg, W. [1981] Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-theoretical Studies, Berlin/Heidelberg/New York: Springer Lecture Notes in Mathematics (Buchholz, e.a., 1981), 16–77.

    Chapter  Google Scholar 

  • Friedman, H. [1978] Classically and intuitionistically provably recursive functions, in: Higher Set Theory, Proceedings, Oberwolfach, 1977, G. H. Müller and D. S. Scott, eds., Berlin/Heidelberg/New York: Springer Lecture Notes in Mathematics, 669, 21–27.

    Chapter  Google Scholar 

  • Gödel, K. [1933] The present situation in the foundations of mathematics, in: Collected Works III, 45–53.

    Google Scholar 

  • Gödel, K. [1938] Lecture at Zilsel’s, in: Collected Works III, 84–113.

    Google Scholar 

  • Gödel, K. [1947] What is Cantor’s continuum problem?, American Mathematical Monthly, 54, 515–525; also in: Collected Works II, 176–187.

    Article  MathSciNet  Google Scholar 

  • Gödel, K. [1951] Some basic theorems on the foundations of mathematics and their implications, Gibbs Lecture, in: Collected Works III.

    Google Scholar 

  • Gödel, K. [1965] Postscriptum (to 1934 Princeton Lectures), in: (Davis 1965), 71–73.

    Google Scholar 

  • Gödel, K. [1972] Some remarks on the undecidability results, in: Collected Works II, 305–306.

    Google Scholar 

  • Gödel, K. [1986] Collected Works, volume I, Oxford.

    Google Scholar 

  • Gödel, K. [1990] Collected Works, volume II, Oxford.

    Google Scholar 

  • Gödel, K. [1995] Collected Works, volume III, Oxford.

    Google Scholar 

  • Hilbert, D. [1918] Prinzipien der Mathematik, Lectures given in the winter term 1917/18, written by P. Bernays.

    Google Scholar 

  • Hilbert, D. [1926] Über das Unendliche, in: (van Heijenoort 1967), 367–392.

    Google Scholar 

  • Hilbert, D. [1927] Die Grundlagen der Mathematik, in: (van Heijenoort 1967), 464–479.

    Google Scholar 

  • Hilbert, D. and Bernays, P. [1935] Grundlagen der Mathematik, vol. I, Berlin.

    Google Scholar 

  • Hilbert, D. and Bernays, P. [1939] Grundlagen der Mathematik, vol. II, Berlin.

    Google Scholar 

  • Kreisel, G. and Troelstra, A. S. [1970] Formal systems for some branches of intuitionistic analysis, Annals of Mathematical Logic, 1(3), 229–387.

    Article  MathSciNet  Google Scholar 

  • Mac Lane, S. [1971] Categorical algebra and set-theoretic foundations, in: Axiomatic Set Theory, Proceeings of the Symposia in Pure Mathematics, vol. XIII, Part I, Providence, 231–240.

    Article  MathSciNet  Google Scholar 

  • Pohlers, W. [1989] Proof Theory — An Introduction, Berlin/Heidelberg/New York: Springer Lecture Notes in Mathematics, 1407.

    MATH  Google Scholar 

  • Post, E. [1936] Finite combinatory processes. Formulation I, Journal of Symbolic Logjic, 1, 103–105; also in: (Davis 1965), 289–291.

    Article  Google Scholar 

  • Post, E. [1944] Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, 50, 284–316; also in (Davis 1965), 305–337.

    Article  MathSciNet  Google Scholar 

  • Rathjen, M. [1991] Proof-theoretic analysis of KPM, Archive of Mathematical Logic, 30, 377–403.

    Article  MathSciNet  Google Scholar 

  • Sieg, W. [1984] Foundations for analysis and proof theory, Synthese, 60(2), 159–200.

    Article  MathSciNet  Google Scholar 

  • Sieg, W. [1988] Hilbert’s program sixty years later, Journal of Symbolic Logjic, 53(2), 338–348.

    Article  MathSciNet  Google Scholar 

  • Sieg, W. [1990] Review of “S.G. Simpson, Friedman’s research on subsystems of second order arithmetic”, Journal of Symbolic Logic, 55, 870–874.

    Article  Google Scholar 

  • Sieg, W. and Parsons, C. D. [1994] Introductory note to (Gödel, 1938), in: Collected Works III, 62–84.

    Google Scholar 

  • Simpson, S. G. [1988] Partial realizations of Hilbert’s program, Journal of Symbolic Logic, 53(2), 349–363.

    Article  MathSciNet  Google Scholar 

  • Turing, A. [1936] On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, 42, 230–265; also in (Davis, 1965), 116–151.

    MathSciNet  MATH  Google Scholar 

  • Turing, A. [1947] Lecture to the London Mathematical Society on 20 February 1947, in: A. M. Turing’s ACE report of 1946 and other papers, B. E. Carpenter and R. W. Doran, eds., Cambridge, 1986, 106–124.

    Google Scholar 

  • Turing, A. [1948] Intelligent Machinery, written in September 1947, submitted to the National Physical Laborartory in 1948, and reprinted in: Machine Intelligence, 5, Edingburgh, 3–23.

    Google Scholar 

  • van Heijenoort, J., ed. [1967] From Frege to Gödel, Cambridge (Mass.).

    Google Scholar 

  • Weyl, H. [1927] Diskussionsbemerkungen zu dem zweiten Hilbertschen Vortrag über die Grundlagen der Mathematik, in: (van Heijenoort, 1967), 480–484.

    Google Scholar 

  • Zermelo, E. [1930] Über Grenzzahlen und Mengenbereiche, Fund Math., 16, 29–47.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Sieg, W. (1997). Aspects of Mathematical Experience. In: Agazzi, E., Darvas, G. (eds) Philosophy of Mathematics Today. Episteme, vol 22. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5690-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-5690-5_11

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6400-2

  • Online ISBN: 978-94-011-5690-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics