The proof theory of classical and constructive inductive definitions. A 40 year saga, 1968-2008
| Abstract | 1. Pohlers and The Problem. I first met Wolfram Pohlers at a workshop on proof theory organized by Walter Felscher that was held in Tübingen in early April, 1973. Among others at that workshop relevant to the work surveyed here were Kurt Schütte, Wolfram’s teacher in Munich, and Wolfram’s fellow student Wilfried Buchholz. This is not meant to slight in the least the many other fine logicians who participated there.2 In Tübingen I gave a couple of survey lectures on results and problems in proof theory that had been occupying much of my attention during the previous decade. The following was the central problem that I emphasized there: The need for an ordinally informative, conceptually clear, proof-theoretic reduction of classical theories of iterated arithmetical inductive definitions to corresponding constructive systems. As will be explained below, meeting that need would be significant for the then ongoing efforts at establishing the constructive foundation for and proof-theoretic ordinal analysis of certain impredicative subsystems of classical analysis. I also spoke in Tübingen about.. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesWolfram Pohlers (1996). Pure Proof Theory Aims, Methods and Results. Bulletin of Symbolic Logic 2 (2):159-188.
Sara Negri (2011). Proof Analysis: A Contribution to Hilbert's Last Problem. Cambridge University Press.
Peter Schroeder-Heister (2006). Validity Concepts in Proof-Theoretic Semantics. Synthese 148 (3):525 - 571.
Gerhard Jäger (2001). First Order Theories for Nonmonotone Inductive Definitions: Recursively Inaccessible and Mahlo. Journal of Symbolic Logic 66 (3):1073-1089.
L. Gordeev (1990). Generalizations of the Kruskal-Friedman Theorems. Journal of Symbolic Logic 55 (1):157-181.
Katalin Bimbó (2007). $LE^{T}{Rightarrow}$ , $LR^{Circ}{Wedgesim}$ , LK and Cutfree Proofs. Journal of Philosophical Logic 36 (5):557 - 570.
Jeremy Avigad (2004). Forcing in Proof Theory. Bulletin of Symbolic Logic 10 (3):305-333.
Lars Hallnäs (2006). On the Proof-Theoretic Foundation of General Definition Theory. Synthese 148 (3):589 - 602.
Solomon Feferman (2000). Does Reductive Proof Theory Have a Viable Rationale? Erkenntnis 53 (1-2):63-96.
Reinhard Kahle (2002). Mathematical Proof Theory in the Light of Ordinal Analysis. Synthese 133 (1-2):237 - 255.
Analytics
Monthly downloads |
Added to index2009-08-29Total downloads54 ( #18,805 of 549,069 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
