Synthese 171 (3):419 - 432 (2009)
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.
|Keywords||Proof Philosophy of logic Anti-realism Wittgenstein Dummett|
|Categories||categorize this paper)|
References found in this work BETA
Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.
Citations of this work BETA
No citations found.
Similar books and articles
Rule-Following and the Objectivity of Proof.Cesare Cozzo - 2004 - In Annalisa Coliva & Eva Picardi (eds.), Wittgenstein Today. Il poligrafo. pp. 185--200.
"A Mathematical Proof Must Be Surveyable" What Wittgenstein Meant by This and What It Implies.Felix Mühlhölzer - 2005 - Grazer Philosophische Studien 71 (1):57-86.
Wittgenstein, Dreaming and Anti-Realism: A Reply to Richard Scheer.William Child - 2009 - Philosophical Investigations 32 (4):329-337.
Wittgenstein's On Certainty and Contemporary Anti-Scepticism.Duncan Pritchard - 2005 - In D. Moyal-Sharrock & W. H. Brenner (eds.), Investigating On Certainty: Essays on Wittgenstein's Last Work. Palgrave-Macmillan.
Dreaming, Calculating, Thinking: Wittgenstein and Anti-Realism About the Past.William Child - 2007 - Philosophical Quarterly 57 (227):252–272.
Added to index2009-01-28
Total downloads78 ( #65,335 of 2,154,061 )
Recent downloads (6 months)12 ( #45,539 of 2,154,061 )
How can I increase my downloads?