Ordinal notations based on a weakly Mahlo cardinal. - Michael Rathjen (Arch. Math. Log., 1990)

Proof-theoretic analysis of KPM. - Michael Rathjen (Arch. Math. Log., 1991)

The Role of Parameters in Bar Rule and Bar Induction. - Michael Rathjen (J. Symb. Log., 1991)

A Proof-Theoretic Characterization of the Primitive Recursive Set Functions. - Michael Rathjen (J. Symb. Log., 1992)

Proof-Theoretic Investigations on Kruskal's Theorem. - Michael Rathjen; Andreas Weiermann (Ann. Pure Appl. Log., 1993)

How to Develop Proof-Theoretic Ordinal Functions on the Basis of Admissible Ordinals. - Michael Rathjen (Math. Log. Q., 1993)

The strength of some Martin-Löf type theories. - Edward R. Griffor; Michael Rathjen (Arch. Math. Log., 1994)

Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM. - Michael Rathjen (Arch. Math. Log., 1994)

Proof Theory of Reflection. - Michael Rathjen (Ann. Pure Appl. Log., 1994)

The Higher Infinite in Proof Theory. - Michael Rathjen (Logic Colloquium, 1995)

Recent advances in ordinal analysis: pi12 - CA and related systems. - Michael Rathjen (Bull. Symb. Log., 1995)

Monotone Inductive Definitions in Explicit Mathematics. - Michael Rathjen (J. Symb. Log., 1996)

The Recursively Mahlo Property in Second Order Arithmetic. - Michael Rathjen (Math. Log. Q., 1996)

On the Proof-Theoretic Strength of Monotone Induction in Explicit Mathematics. - Thomas Glaß; Michael Rathjen; Andreas Schlüter (Ann. Pure Appl. Log., 1997)

Inaccessibility in Constructive Set Theory and Type Theory. - Michael Rathjen; Edward R. Griffor; Erik Palmgren (Ann. Pure Appl. Log., 1998)

Explicit Mathematics with the Monotone Fixed Point Principle. - Michael Rathjen (J. Symb. Log., 1998)

Explicit Mathematics with The Monotone Fixed Point Principle. II: Models. - Michael Rathjen (J. Symb. Log., 1999)

The strength of Martin-Löf type theory with a superuniverse. Part I. - Michael Rathjen (Arch. Math. Log., 2000)

The strength of Martin-Löf type theory with a superuniverse. Part II. - Michael Rathjen (Arch. Math. Log., 2001)

Kripke-Platek Set Theory and the Anti-Foundation Axiom. - Michael Rathjen (Math. Log. Q., 2001)

A note on the Sigma1 spectrum of a theory. - Michael Möllerfeld; Michael Rathjen (Arch. Math. Log., 2002)

Inaccessible set axions may have little consistency strength. - Laura Crosilla; Michael Rathjen (Ann. Pure Appl. Log., 2002)

Realizing Mahlo set theory in type theory. - Michael Rathjen (Arch. Math. Log., 2003)

On the regular extension axiom and its variants. - Michael Rathjen; Robert S. Lubarsky (Math. Log. Q., 2003)

Generalized Inductive Definitions in Constructive Set Theory. - Michael Rathjen (From sets and types to topology and analysis, 2005)

An ordinal analysis of stability. - Michael Rathjen (Arch. Math. Log., 2005)

An ordinal analysis of parameter free Pi12-comprehension. - Michael Rathjen (Arch. Math. Log., 2005)

Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory. - Michael Rathjen (Ann. Pure Appl. Log., 2005)

The disjunction and related properties for constructive Zermelo-Fraenkel set theory. - Michael Rathjen (J. Symb. Log., 2005)

Constructive Set Theory and Brouwerian Principles. - Michael Rathjen (J. Univers. Comput. Sci., 2005)

The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory. - Michael Rathjen (Synth., 2005)

Models of Intuitionistic Set Theories over Partial Combinatory Algebras. - Michael Rathjen (TAMC, 2006)

Characterizing the interpretation of set theory in Martin-Löf typetheory. - Michael Rathjen; Sergei Tupailo (Ann. Pure Appl. Log., 2006)

A note on Bar Induction in Constructive Set Theory. - Michael Rathjen (Math. Log. Q., 2006)

Theories and Ordinals in Proof Theory. - Michael Rathjen (Synth., 2006)

Theories and Ordinals: Ordinal Analysis. - Michael Rathjen (CiE, 2007)

On the Constructive Dedekind Reals: Extended Abstract. - Robert S. Lubarsky; Michael Rathjen (LFCS, 2007)

On the constructive Dedekind reals. - Robert S. Lubarsky; Michael Rathjen (Log. Anal., 2008)

The natural numbers in constructive set theory. - Michael Rathjen (Math. Log. Q., 2008)

Reverse mathematics and well-ordering principles: A pilot study. - Bahareh Afshari; Michael Rathjen (Ann. Pure Appl. Log., 2009)

A note on the theory of positive induction, ID*1. - Bahareh Afshari; Michael Rathjen (Arch. Math. Log., 2010)

An ordinal analysis for theories of self-referential truth. - Graham Emil Leigh; Michael Rathjen (Arch. Math. Log., 2010)

Ordinal Analysis and the Infinite Ramsey Theorem. - Bahareh Afshari; Michael Rathjen (CiE, 2012)

Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory. - Ray-Ming Chen; Michael Rathjen (Arch. Math. Log., 2012)

From the weak to the strong existence property. - Michael Rathjen (Ann. Pure Appl. Log., 2012)

The Friedman - Sheard programme in intuitionistic logic. - Graham Emil Leigh; Michael Rathjen (J. Symb. Log., 2012)

Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions. - Michael Rathjen (Epistemology versus Ontology, 2012)

Realizability Models Separating Various Fan Theorems. - Robert S. Lubarsky; Michael Rathjen (CiE, 2013)

Slow consistency. - Sy-David Friedman; Michael Rathjen; Andreas Weiermann (Ann. Pure Appl. Log., 2013)

Relativized ordinal analysis: The case of Power Kripke-Platek set theory. - Michael Rathjen (Ann. Pure Appl. Log., 2014)

Constructive Zermelo-Fraenkel set theory and the limited principle of omniscience. - Michael Rathjen (Ann. Pure Appl. Log., 2014)

Well-partial-orderings and the big Veblen number. - Jeroen Van der Meeren; Michael Rathjen; Andreas Weiermann (Arch. Math. Log., 2015)

Classifying the Provably Total set Functions of KP and KP(P). - Michael Rathjen; Jacob Cook (FLAP, 2016)

Indefiniteness in Semi-Intuitionistic Set Theories: on a Conjecture of Feferman. - Michael Rathjen (J. Symb. Log., 2016)

An order-theoretic characterization of the Howard-Bachmann-hierarchy. - Jeroen Van der Meeren; Michael Rathjen; Andreas Weiermann (Arch. Math. Log., 2017)

Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition. - Michael Rathjen; Jeroen Van der Meeren; Andreas Weiermann (Arch. Math. Log., 2017)

Long Sequences of Descending Theories and other Miscellanea on Slow Consistency. - Michael Rathjen (FLAP, 2017)

A Note on the Ordinal Analysis of mathbf RCA_0 + mathrm WO( mathbf σ ) RCA 0 + WO ( σ ). - Lorenzo Carlucci; Leonardo Mainardi; Michael Rathjen (CiE, 2019)

Upper bounds on the graph minor theorem. - Martin Krombholz; Michael Rathjen (CoRR, 2019)

Preservation of choice principles under realizability. - Eman Dihoum; Michael Rathjen (Log. J. IGPL, 2019)

Minimal bad sequences are necessary for a uniform Kruskal theorem. - Anton Freund; Michael Rathjen; Andreas Weiermann (CoRR, 2020)

Lifschitz Realizability as a Topological Construction. - Michael Rathjen; Andrew W. Swan (J. Symb. Log., 2020)

Power Kripke-Platek set theory and the axiom of choice. - Michael Rathjen (J. Log. Comput., 2020)

Derivatives of normal functions in reverse mathematics. - Anton Freund; Michael Rathjen (Ann. Pure Appl. Log., 2021)

No speedup for geometric theories. - Michael Rathjen (CoRR, 2021)

A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice. - Maria Emilia Maietti; Samuele Maschio; Michael Rathjen (Log. Methods Comput. Sci., 2021)

Extensional realizability for intuitionistic set theory. - Emanuele Frittaion; Michael Rathjen (J. Log. Comput., 2021)

Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice. - Maria Emilia Maietti; Samuele Maschio; Michael Rathjen (Log. Methods Comput. Sci., 2022)

Choice and independence of premise rules in intuitionistic set theory. - Emanuele Frittaion; Takako Nemoto; Michael Rathjen (Ann. Pure Appl. Log., 2023)

Admissible extensions of subtheories of second order arithmetic. - Gerhard Jäger; Michael Rathjen (Ann. Pure Appl. Log., 2024)

Constructing the constructible universe constructively. - Richard Matthews; Michael Rathjen (Ann. Pure Appl. Log., 2024)

Intuitionistic sets and numbers: small set theory and Heyting arithmetic. - Stewart Shapiro; Charles McCarty; Michael Rathjen (Arch. Math. Log., 2025)