-
34An Upper Bound for the Provability of Transfinite Induction in Systems with N-Times Iterated Inductive DefinitionsJournal of Symbolic Logic 48 (3): 878. 1983.
-
19Books to ASL, Box 742, Vassar College, 124 Raymond Avenue, Poughkeepsie, NY 12604, USABulletin of Symbolic Logic 10 (3). 2004.
-
The Bulletin of Symbolic Logic Volume 11, Number 2, June 2005Bulletin of Symbolic Logic 11 (2). 2005.
-
49Vassar college, 124 Raymond avenue, poughkeepsie, ny 12604, usa. In a review, a reference “jsl xliii 148,” for example, refers either to the publication reviewed on page 148 of volume 43 of the journal, or to the review itself (which contains full bibliographical information for the reviewed publication). Analogously, a reference “bsl VII 376” refers to the review beginning on page 376 in volume 7 of this bulletin, or (review)Bulletin of Symbolic Logic 11 (1): 37. 2005.
-
10Books to asl, box 742, vassar college, 124 Raymond avenue, poughkeepsie, ny 12604, usa. In a review, a reference “jsl xliii 148,” for example, refers either to the publication reviewed on page 148 of volume 43 of the journal, or to the review itself (which contains full bibliographical information for the reviewed publication). Analogously, a reference (review)Bulletin of Symbolic Logic 11 (2). 2005.
-
3Provably Recursive Functions of ReflectionIn Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation, De Gruyter. pp. 381-474. 2012.
-
63Subsystems of set theory and second order number theoryIn Samuel R. Buss (ed.), Handbook of proof theory, Elsevier. pp. 137--209. 1998.
-
28Subsystems of Set Theory and Second-Order Number TheoryBulletin of Symbolic Logic 6 (4): 467-469. 2000.
-
109Provable Wellorderings of Formal Theories for Transfinitely Iterated Inductive DefinitionsJournal of Symbolic Logic 48 (3): 878. 1983.
-
302004 Summer Meeting of the Association for Symbolic LogicBulletin of Symbolic Logic 11 (2): 249-312. 2005.
-
6Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1Archive for Mathematical Logic 21 (1): 113-129. 1981.
-
27Ordinal notations based on a hierarchy of inaccessible cardinalsAnnals of Pure and Applied Logic 33 (C): 157-179. 1987.
-
119Pure proof theory aims, methods and resultsBulletin of Symbolic Logic 2 (2): 159-188. 1996.Apologies. The purpose of the following talk is to give an overview of the present state of aims, methods and results in Pure Proof Theory. Shortage of time forces me to concentrate on my very personal views. This entails that I will emphasize the work which I know best, i.e., work that has been done in the triangle Stanford, Munich and Münster. I am of course well aware that there are as important results coming from outside this triangle and I apologize for not displaying these results as well…Read more
-
86Ordinal analysis of non-monotone http://ars. els-cdn. com/content/image/http://origin-ars. els-cdn. com/content/image/1-s2. 0-S0168007208000924-si1. gif"/>-definable inductive definitions (review)Annals of Pure and Applied Logic 156 (1): 160-169. 2008.
-
52Proof theory and ordinal analysisArchive for Mathematical Logic 30 (5-6): 311-376. 1991.In the first part we show why ordinals and ordinal notations are naturally connected with proof theoretical research. We introduce the program of ordinal analysis. The second part gives examples of applications of ordinal analysis
-
31Ordinals connected with formal theories for transfinitely iterated inductive definitionsJournal of Symbolic Logic 43 (2): 161-182. 1978.
-
7Cut-Elimination for Impredicative Infinitary Systems. Part I. Ordinal- Analysis for ID 1Journal of Symbolic Logic 48 (3): 879-880. 1983.
-
24Hilbert’s Programme and Ordinal AnalysisIn Peter Schuster & Dieter Probst (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science, De Gruyter. pp. 291-322. 2016.
-
36Editorial Logic Colloquium '95, Haifa, Israel : Invited papers on proof theoryArchive for Mathematical Logic 37 (5-6): 273-273. 1998.
-
9Editorial Logic Colloquium 95, Haifa, Israel Invited papers on proof theoryArchive for Mathematical Logic 36 (4-5). 1997.
-
10Applications of Cut-Free Infinitary Derivations to Generalized Recursion TheoryBulletin of Symbolic Logic 6 (2): 221-222. 2000.
-
58Provable wellorderings of formal theories for transfinitely iterated inductive definitionsJournal of Symbolic Logic 43 (1): 118-125. 1978.
-
47Applications of cut-free infinitary derivations to generalized recursion theoryAnnals of Pure and Applied Logic 94 (1-3): 7-19. 1998.We prove that the boundedness theorem of generalized recursion theory can be derived from the ω-completeness theorem for number theory. This yields a proof of the boundedness theorem which does not refer to the analytical hierarchy theorem
Wolfram Pohlers
University of Muenster
-
University of MuensterRetired faculty
Areas of Specialization
Other Academic Areas |
Areas of Interest
Other Academic Areas |