Radical anti-realism, Wittgenstein and the length of proofs

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.

[1]  Dag Prawitz,et al.  On the idea of a general proof theory , 1974, Synthese.

[2]  D. Prawitz.  Natural Deduction: A Proof-Theoretical Study , 1965 .

[3]  Felix Mühlhölzer.  "A Mathematical Proof Must Be Surveyable" What Wittgenstein Meant by This and What It Implies , 2006 .

[4]  M. Dummett.  Truth and other enigmas , 1978 .

[5]  P. Pudlák.  Chapter VIII - The Lengths of Proofs , 1998 .

[6]  Stewart Shapiro,et al.  The Oxford Handbook of Philosophy of Mathematics and Logic , 2005, Oxford handbooks in philosophy.

[7]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[8]  Paolo Mancosu,et al.  On Mathematical Explanation , 2000 .

[9]  M. Marion.  Wittgenstein, finitism, and the foundations of mathematics , 1998 .

[10]  Jacques Dubucs,et al.  Feasibility In Logic , 2002, Synthese.

[11]  Jacques Dubucs,et al.  On Bolzano’s Alleged Explicativism , 2004, Synthese.

[12]  Alessandra Carbone,et al.  Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination , 1996 .

[13]  R. Gandy.  Limitations to Mathematical Knowledge , 1982 .

[14]  Alessandra Carbone,et al.  Cycling in proofs and feasibility , 1999 .

[15]  Armin Tatzel.  Bolzano's Theory of Ground and Consequence , 2002, Notre Dame J. Formal Log..

[16]  Martin D. Davis,et al.  Why Gödel Didn't Have Church's Thesis , 1982, Inf. Control..

[17]  Michael Mendler,et al.  The NASA STI Program Office provides , 2000 .

[18]  Peter Schroeder-Heister,et al.  Validity Concepts in Proof-theoretic Semantics , 2006, Synthese.

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  C. Wright.  Realism, Meaning, And Truth , 1987 .

[21]  Dag Prawitz.  Formulation des bétons autoplaçants : Optimisation du squelette granulaire par la méthode graphique de Dreux - Gorisse , 1974 .

[22]  Rohit Parikh,et al.  Existence and feasibility in arithmetic , 1971, Journal of Symbolic Logic.

[23]  Dag Prawitz,et al.  Meaning Approached Via Proofs , 2006, Synthese.

[24]  Jean-Yves Girard.  Light Linear Logic , 1994, LCC.

[25]  Andrea Asperti,et al.  Intuitionistic Light Affine Logic , 2002, TOCL.

[26]  A. R. D. Mathias,et al.  A Term of Length 4 523 659 424 929 , 2002, Synthese.

[27]  J. Dubucs,et al.  Radical Anti-Realism and Substructural Logics , 2003 .

[28]  Daniel Leivant,et al.  A Foundational Delineation of Poly-time , 1994, Inf. Comput..

[29]  Martin Hofmann,et al.  A New "Feasible" Arithmetic , 2002, J. Symb. Log..

[30]  Interpreting Arithmetic : Russell on Applicability and Wittgenstein on Surveyability , 2007 .

[31]  M. Dummett.  The seas of language , 1993 .

[32]  Dag Prawitz.  Logical Consequence: A Constructivist View , 2005 .