-
89Provable Wellorderings of Formal Theories for Transfinitely Iterated Inductive DefinitionsJournal of Symbolic Logic 48 (3): 878. 1983.
-
79An Upper Bound for the Provability of Transfinite Induction in Systems with N-Times Iterated Inductive DefinitionsJournal of Symbolic Logic 48 (3): 878. 1983.
-
57Ordinal analysis of non-monotone-definable inductive definitionsAnnals of Pure and Applied Logic 156 (1): 160-169. 2008.Exploiting the fact that -definable non-monotone inductive definitions have the same closure ordinal as arbitrary arithmetically definable monotone inductive definitions, we show that the proof theoretic ordinal of an axiomatization of -definable non-monotone inductive definitions coincides with the proof theoretic ordinal of the theory of arithmetically definable monotone inductive definitions
-
42Subsystems of set theory and second order number theoryIn Samuel R. Buss (ed.), Bulletin of Symbolic Logic, Elsevier. pp. 137--209. 1998.
-
39Pure 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
-
39Applications 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
-
39Proof 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
-
39Provable wellorderings of formal theories for transfinitely iterated inductive definitionsJournal of Symbolic Logic 43 (1): 118-125. 1978.
-
36Pure Proof Theory. Mathematicians are interested in structures. There is only one way to find the theorems of a structure. Start with an axiom system for the structure and deduce the theorems logically. These axiom systems are the objects of proof-theoretical research. Studying axiom systems there is a series of more (review)Bulletin 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
-
26Subsystems of Set Theory and Second-Order Number TheoryBulletin of Symbolic Logic 6 (4): 467-469. 2000.
-
25Editorial Logic Colloquium '95, Haifa, Israel : Invited papers on proof theoryArchive for Mathematical Logic 37 (5-6): 273-273. 1998.
-
202004 Summer Meeting of the Association for Symbolic LogicBulletin of Symbolic Logic 11 (2): 249-312. 2005.
-
17Ordinal notations based on a hierarchy of inaccessible cardinalsAnnals of Pure and Applied Logic 33 (C): 157-179. 1987.
-
16Hilbert’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.
-
14Ordinal 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.
-
14Ordinals connected with formal theories for transfinitely iterated inductive definitionsJournal of Symbolic Logic 43 (2): 161-182. 1978.
-
6Applications of Cut-Free Infinitary Derivations to Generalized Recursion TheoryBulletin of Symbolic Logic 6 (2): 221-222. 2000.
-
4Editorial Logic Colloquium 95, Haifa, Israel Invited papers on proof theoryArchive for Mathematical Logic 36 (4-5). 1997.
-
2Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1Archive for Mathematical Logic 21 (1): 113-129. 1981.
-
1X1. AimsBulletin 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
-
Cut-Elimination for Impredicative Infinitary Systems. Part I. Ordinal- Analysis for ID 1Journal of Symbolic Logic 48 (3): 879-880. 1983.
-
Provably Recursive Functions of ReflectionIn Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation, De Gruyter. pp. 381-474. 2012.
Wolfram Pohlers
University of Muenster
-
University of MuensterRetired faculty
Areas of Specialization
Other Academic Areas |
Areas of Interest
Other Academic Areas |