Radical anti-realism, Wittgenstein and the length of proofs

Synthese 171 (3):419 - 432 (2009)
  Copy   BIBTEX

Abstract

After sketching an argument for radical anti-realism that does not appeal to human limitations but polynomial-time computability in its definition of feasibility, I revisit an argument by Wittgenstein on the surveyability of proofs, and then examine the consequences of its application to the notion of canonical proof in contemporary proof-theoretical-semantics.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

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
2009-01-28

Downloads
138 (#123,533)

6 months
12 (#122,295)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Mathieu Marion
Université du Québec à Montréal

References found in this work

Truth and other enigmas.Michael Dummett - 1978 - Cambridge: Harvard University Press.
Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
The seas of language.Michael Dummett - 1993 - New York: Oxford University Press.
Truth and Other Enigmas.Michael Dummett - 1980 - Revue Philosophique de la France Et de l'Etranger 170 (1):62-65.

View all 24 references / Add more references