David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
In the Wednesday Logic Reading Group, where we are working through Sara Negri and Jan von Plato’s Structural Proof Theory – henceforth ‘NvP’ – I today introduced Chapter 6, ‘Structural Proof Analysis of Axiomatic Theories’. In their commendable efforts to be brief, the authors are sometimes a bit brisk about motivation. So I thought it was worth trying to stand back a bit from the details of this action-packed chapter as far as I understood it in the few hours I had to prepare, and to try to give an overall sense of the project. These are the notes I wrote for myself. As often with such middle-of-term efforts dashed off in a couple of hours, I both would have liked to do better and do more justice to what we are reading, but I also just don’t have time to do more now than make a few corrections to the first version. So the usual warning applies: caveat lector.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Sara Negri & Jan Von Plato (1998). Cut Elimination in the Presence of Axioms. Bulletin of Symbolic Logic 4 (4):418-435.
Renling Jin (1997). Type Two Cuts, Bad Cuts and Very Bad Cuts. Journal of Symbolic Logic 62 (4):1241-1252.
Sara Negri & Jan von Plato (2001). Structural Proof Theory. Cambridge University Press.
Maarten Rijke (1991). A Note on the Interpretability Logic of Finitely Axiomatized Theories. Studia Logica 50 (2):241 - 250.
Sara Negri (2011). Proof Analysis: A Contribution to Hilbert's Last Problem. Cambridge University Press.
Michal Rössler & Emil Jeřábek (2007). Fragment of Nonstandard Analysis with a Finitary Consistency Proof. Bulletin of Symbolic Logic 13 (1):54-70.
Hartry Field (2006). Truth and the Unprovability of Consistency. Mind 115 (459):567 - 605.
W. W. Tait (2005). Gödel's Reformulation of Gentzen's First Consistency Proof for Arithmetic: The No-Counterexample Interpretation. Bulletin of Symbolic Logic 11 (2):225-238.
Gilles Dowek & Olivier Hermant (2012). A Simple Proof That Super-Consistency Implies Cut Elimination. Notre Dame Journal of Formal Logic 53 (4):439-456.
Jan Krajíček & Pavel Pudlák (1989). Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations. Journal of Symbolic Logic 54 (3):1063-1079.
Leszek Aleksander Kołodziejczyk (2006). On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories. Journal of Symbolic Logic 71 (2):624 - 638.
Albert Visser (2012). The Second Incompleteness Theorem and Bounded Interpretations. Studia Logica 100 (1-2):399-418.
Added to index2010-11-27
Total downloads21 ( #137,372 of 1,726,249 )
Recent downloads (6 months)6 ( #118,705 of 1,726,249 )
How can I increase my downloads?