| Publication | Date of Publication | Type |
|---|
| Wellfoundedness proof with the maximal distinguished set | 2023-04-27 | Paper |
| Well-foundedness proof for $\Pi^{1}_{1}$-reflection | 2023-04-07 | Paper |
| Lectures on Ordinal Analysis | 2023-04-01 | Paper |
| Provably well-founded strict partial orders | 2023-03-24 | Paper |
| Wellfoundedness proof with the maximal distinguished set | 2022-11-15 | Paper |
| An ordinal analysis of $\Pi_{1}$-Collection | 2021-12-18 | Paper |
| Cut-Elimination for SBL | 2021-12-03 | Paper |
| GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION | 2021-09-17 | Paper |
| A SIMPLIFIED ORDINAL ANALYSIS OF FIRST-ORDER REFLECTION | 2021-03-19 | Paper |
| Ordinal Analysis with an Introduction to Proof Theory | 2020-09-04 | Paper |
| A constructive proof of a theorem by Ferreira-Zantema | 2020-08-17 | Paper |
| Refinement of proof-theoretic analysis of the lpo due to Buchholz | 2020-08-17 | Paper |
| Predicatively unprovable termination of the Ackermannian Goodstein process | 2020-06-11 | Paper |
| Proof-theoretic strengths of the well-ordering principles | 2020-04-01 | Paper |
| Two remarks on proof theory of first-order arithmetic | 2020-03-29 | Paper |
| Mahlo classes for first-order reflections | 2019-10-15 | Paper |
| Iterating the recursively Mahlo operations | 2019-04-23 | Paper |
| Grzegorczyk sequence | 2018-11-25 | Paper |
| PROOF-THEORETIC STRENGTHS OF WEAK THEORIES FOR POSITIVE INDUCTIVE DEFINITIONS | 2018-10-26 | Paper |
| Cut-elimination for \(\omega_{1}\) | 2018-10-18 | Paper |
| Derivatives of normal functions and \(\omega \)-models | 2018-08-16 | Paper |
| Hydra games for recursively Mahlo operations | 2018-08-14 | Paper |
| Cut-elimination for $\omega_{1}$ | 2018-01-27 | Paper |
| Proof Theory for Theories of Ordinals III: $$\Pi _{N}$$ -Reflection | 2017-09-27 | Paper |
| Cut-eliminability in second order logic calculi | 2017-01-04 | Paper |
| Cut-elimination for SBL | 2016-06-13 | Paper |
| A new function algebra of EXPTIME functions by safe nested recursion | 2015-09-17 | Paper |
| Intuitionistic fixed point theories over set theories | 2015-09-01 | Paper |
| $omega_{1}$ under $Pi_{1}$-Collection | 2015-08-06 | Paper |
| Hydras for $\omega_{1}$ | 2015-08-06 | Paper |
| Well-foundedness proof for first-order reflection | 2015-06-17 | Paper |
| Predicatively computable functions on sets | 2015-04-14 | Paper |
| Axiomatizing some small classes of set functions | 2015-03-27 | Paper |
| CONSERVATIONS OF FIRST-ORDER REFLECTIONS | 2014-12-05 | Paper |
| LIFTING PROOF THEORY TO THE COUNTABLE ORDINALS: ZERMELO-FRAENKEL SET THEORY | 2014-09-30 | Paper |
| Lifting proof theory to the countable ordinals II: second-order indescribable cardinals | 2014-09-04 | Paper |
| A polynomial time complete disjunction property in intuitionistic propositional logic | 2013-12-11 | Paper |
| Proof search in multi-succedent sequent calculi for intuitionistic logic under the Schuette's schema | 2013-12-04 | Paper |
| A Sneak Preview of Proof Theory of Ordinals(<Special Section>Infinity in Philosophy and Mathematics) | 2013-11-18 | Paper |
| PROOF THEORY OF WEAK COMPACTNESS | 2013-10-17 | Paper |
| PROVABLY $\Delta _2^0$ AND WEAKLY DESCENDING CHAINS | 2013-06-03 | Paper |
| Quick cut-elimination for strictly positive cuts | 2011-09-22 | Paper |
| Wellfoundedness proofs by means of non-monotonic inductive definitions. II: First order operators | 2011-09-12 | Paper |
| Intuitionistic fixed point theories over Heyting arithmetic | 2011-05-31 | Paper |
| Nested PLS | 2011-05-11 | Paper |
| Exact bounds on epsilon processes | 2011-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3589379 | 2010-09-20 | Paper |
| Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets | 2009-01-13 | Paper |
| Non-elementary speed-ups in logic calculi | 2008-12-10 | Paper |
| Epsilon substitution method for -FIX | 2007-01-19 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Epsilon substitution method for \([\Pi^0_1,\Pi^0_1\)-FIX] | 2005-12-14 | Paper |
| Ideas in the epsilon substitution method for \(\Pi_{1}^{0}\)-FIX | 2005-09-22 | Paper |
| Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π20-operators | 2005-08-29 | Paper |
| Proof theory for theories of ordinals. II: \(\Pi_{3}\)-reflection | 2004-11-22 | Paper |
| Epsilon substitution method for theories of jump hierarchies | 2003-09-16 | Paper |
| Proof theory for theories of ordinals. I: Recursively Mahlo ordinals | 2003-08-13 | Paper |
| Epsilon substitution method for \(\text{ID}_{1}(\Pi_{1}^{0}\vee{\Sigma} _{1}^{0})\) | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776818 | 2002-05-05 | Paper |
| Ordinal diagrams for Π3-reflection | 2002-02-17 | Paper |
| Ordinal diagrams for recursively Mahlo universes | 2002-01-09 | Paper |
| A bounded arithmetic AID for Frege systems | 2001-05-02 | Paper |
| Extended normal form theorems for logical proofs from axioms | 2000-08-23 | Paper |
| Some results on cut-elimination, provable well-orderings, induction and reflection | 2000-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934555 | 2000-01-17 | Paper |
| Introducing the hardline in proof theory | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252645 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252646 | 1999-08-22 | Paper |
| Variations on a theme by Weiermann | 1999-08-19 | Paper |
| Consistency proof via pointwise induction | 1998-08-10 | Paper |
| A slow growing analogue to Buchholz' proof | 1992-06-28 | Paper |
| Derivability conditions on Rosser's provability predicates | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4207896 | 1988-01-01 | Paper |
| A consistency proof of a system including Feferman's \(ID_{\xi}\) by Takeuti's reduction method | 1987-01-01 | Paper |
| A subsystem of classical analysis proper to Takeuti's reduction method for \(\Pi ^ 1_ 1\)-analysis | 1985-01-01 | Paper |
| An accessibility proof of ordinal diagrams in intuitionistic theories for iterated inductive definitions | 1984-01-01 | Paper |
