Michael Rathjen

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 19

Top Topics

Algebraic Geometry

Top Venues

Ann. Pure Appl. Log.

Arch. Math. Log.

J. Log. Comput.

Publications

Richard Matthews, Michael Rathjen
Constructing the constructible universe constructively. Ann. Pure Appl. Log. 175 (3) (2024)
Gerhard Jäger, Michael Rathjen
Admissible extensions of subtheories of second order arithmetic. Ann. Pure Appl. Log. 175 (7) (2024)
Emanuele Frittaion, Takako Nemoto, Michael Rathjen
Choice and independence of premise rules in intuitionistic set theory. Ann. Pure Appl. Log. 174 (9) (2023)
Maria Emilia Maietti, Samuele Maschio, Michael Rathjen
Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice. Log. Methods Comput. Sci. 18 (4) (2022)
Maria Emilia Maietti, Samuele Maschio, Michael Rathjen
A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice. Log. Methods Comput. Sci. 17 (2) (2021)
Michael Rathjen
No speedup for geometric theories. CoRR (2021)
Anton Freund, Michael Rathjen
Derivatives of normal functions in reverse mathematics. Ann. Pure Appl. Log. 172 (2) (2021)
Emanuele Frittaion, Michael Rathjen
Extensional realizability for intuitionistic set theory. J. Log. Comput. 31 (2) (2021)
Michael Rathjen, Andrew W. Swan
Lifschitz Realizability as a Topological Construction. J. Symb. Log. 85 (4) (2020)
Anton Freund, Michael Rathjen, Andreas Weiermann
Minimal bad sequences are necessary for a uniform Kruskal theorem. CoRR (2020)
Michael Rathjen
Power Kripke-Platek set theory and the axiom of choice. J. Log. Comput. 30 (1) (2020)
Martin Krombholz, Michael Rathjen
Upper bounds on the graph minor theorem. CoRR (2019)
Eman Dihoum, Michael Rathjen
Preservation of choice principles under realizability. Log. J. IGPL 27 (5) (2019)
Lorenzo Carlucci, Leonardo Mainardi, Michael Rathjen
A Note on the Ordinal Analysis of \mathbf RCA_0 + \mathrm WO(\mathbf σ ) RCA 0 + WO ( σ ). CiE (2019)
Jeroen Van der Meeren, Michael Rathjen, Andreas Weiermann
An order-theoretic characterization of the Howard-Bachmann-hierarchy. Arch. Math. Log. 56 (1-2) (2017)
Michael Rathjen, Jeroen Van der Meeren, Andreas Weiermann
Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition. Arch. Math. Log. 56 (5-6) (2017)
Michael Rathjen
Long Sequences of Descending Theories and other Miscellanea on Slow Consistency. FLAP 4 (4) (2017)
Michael Rathjen
Indefiniteness in Semi-Intuitionistic Set Theories: on a Conjecture of Feferman. J. Symb. Log. 81 (2) (2016)
Michael Rathjen, Jacob Cook
Classifying the Provably Total set Functions of KP and KP(P). FLAP 3 (4) (2016)
Jeroen Van der Meeren, Michael Rathjen, Andreas Weiermann
Well-partial-orderings and the big Veblen number. Arch. Math. Log. 54 (1-2) (2015)
Michael Rathjen
Relativized ordinal analysis: The case of Power Kripke-Platek set theory. Ann. Pure Appl. Log. 165 (1) (2014)
Michael Rathjen
Constructive Zermelo-Fraenkel set theory and the limited principle of omniscience. Ann. Pure Appl. Log. 165 (2) (2014)
Robert S. Lubarsky, Michael Rathjen
Realizability Models Separating Various Fan Theorems. CiE (2013)
Sy-David Friedman, Michael Rathjen, Andreas Weiermann
Slow consistency. Ann. Pure Appl. Log. 164 (3) (2013)
Michael Rathjen
From the weak to the strong existence property. Ann. Pure Appl. Log. 163 (10) (2012)
Ray-Ming Chen, Michael Rathjen
Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory. Arch. Math. Log. 51 (7-8) (2012)
Graham Emil Leigh, Michael Rathjen
The Friedman - Sheard programme in intuitionistic logic. J. Symb. Log. 77 (3) (2012)
Bahareh Afshari, Michael Rathjen
Ordinal Analysis and the Infinite Ramsey Theorem. CiE (2012)
Graham Emil Leigh, Michael Rathjen
An ordinal analysis for theories of self-referential truth. Arch. Math. Log. 49 (2) (2010)
Bahareh Afshari, Michael Rathjen
. Arch. Math. Log. 49 (2) (2010)
Bahareh Afshari, Michael Rathjen
Reverse mathematics and well-ordering principles: A pilot study. Ann. Pure Appl. Log. 160 (3) (2009)
Michael Rathjen
The natural numbers in constructive set theory. Math. Log. Q. 54 (1) (2008)
Robert S. Lubarsky, Michael Rathjen
On the constructive Dedekind reals. Log. Anal. 1 (2) (2008)
Robert S. Lubarsky, Michael Rathjen
On the Constructive Dedekind Reals: Extended Abstract. LFCS (2007)
Michael Rathjen
Theories and Ordinals: Ordinal Analysis. CiE (2007)
Michael Rathjen
Models of Intuitionistic Set Theories over Partial Combinatory Algebras. TAMC (2006)
Michael Rathjen, Sergei Tupailo
Characterizing the interpretation of set theory in Martin-Löf typetheory. Ann. Pure Appl. Log. 141 (3) (2006)
Michael Rathjen
A note on Bar Induction in Constructive Set Theory. Math. Log. Q. 52 (3) (2006)
Michael Rathjen
Theories and Ordinals in Proof Theory. Synth. 148 (3) (2006)
Michael Rathjen
Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory. Ann. Pure Appl. Log. 136 (1-2) (2005)
Michael Rathjen
Constructive Set Theory and Brouwerian Principles. J. Univers. Comput. Sci. 11 (12) (2005)
Michael Rathjen
The disjunction and related properties for constructive Zermelo-Fraenkel set theory. J. Symb. Log. 70 (4) (2005)
Michael Rathjen
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory. Synth. 147 (1) (2005)
Michael Rathjen
An ordinal analysis of stability. Arch. Math. Log. 44 (1) (2005)
Michael Rathjen
-comprehension. Arch. Math. Log. 44 (3) (2005)
Michael Rathjen
Realizing Mahlo set theory in type theory. Arch. Math. Log. 42 (1) (2003)
Michael Rathjen, Robert S. Lubarsky
On the regular extension axiom and its variants. Math. Log. Q. 49 (5) (2003)
Michael Möllerfeld, Michael Rathjen
A note on the Sigma1 spectrum of a theory. Arch. Math. Log. 41 (1) (2002)
Laura Crosilla, Michael Rathjen
Inaccessible set axions may have little consistency strength. Ann. Pure Appl. Log. 115 (1-3) (2002)
Michael Rathjen
Kripke-Platek Set Theory and the Anti-Foundation Axiom. Math. Log. Q. 47 (4) (2001)
Michael Rathjen
The strength of Martin-Löf type theory with a superuniverse. Part II. Arch. Math. Log. 40 (3) (2001)
Michael Rathjen
The strength of Martin-Löf type theory with a superuniverse. Part I. Arch. Math. Log. 39 (1) (2000)
Michael Rathjen
Explicit Mathematics with The Monotone Fixed Point Principle. II: Models. J. Symb. Log. 64 (2) (1999)
Michael Rathjen
Explicit Mathematics with the Monotone Fixed Point Principle. J. Symb. Log. 63 (2) (1998)
Michael Rathjen, Edward R. Griffor, Erik Palmgren
Inaccessibility in Constructive Set Theory and Type Theory. Ann. Pure Appl. Log. 94 (1-3) (1998)
Thomas Glaß, Michael Rathjen, Andreas Schlüter
On the Proof-Theoretic Strength of Monotone Induction in Explicit Mathematics. Ann. Pure Appl. Log. 85 (1) (1997)
Michael Rathjen
The Recursively Mahlo Property in Second Order Arithmetic. Math. Log. Q. 42 (1996)
Michael Rathjen
Monotone Inductive Definitions in Explicit Mathematics. J. Symb. Log. 61 (1) (1996)
Michael Rathjen
- CA and related systems. Bull. Symb. Log. 1 (4) (1995)
Michael Rathjen
The Higher Infinite in Proof Theory. Logic Colloquium (1995)
Michael Rathjen
Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM. Arch. Math. Log. 33 (1) (1994)
Michael Rathjen
Proof Theory of Reflection. Ann. Pure Appl. Log. 68 (2) (1994)
Edward R. Griffor, Michael Rathjen
The strength of some Martin-Löf type theories. Arch. Math. Log. 33 (5) (1994)
Michael Rathjen
How to Develop Proof-Theoretic Ordinal Functions on the Basis of Admissible Ordinals. Math. Log. Q. 39 (1993)
Michael Rathjen, Andreas Weiermann
Proof-Theoretic Investigations on Kruskal's Theorem. Ann. Pure Appl. Log. 60 (1) (1993)
Michael Rathjen
A Proof-Theoretic Characterization of the Primitive Recursive Set Functions. J. Symb. Log. 57 (3) (1992)
Michael Rathjen
The Role of Parameters in Bar Rule and Bar Induction. J. Symb. Log. 56 (2) (1991)
Michael Rathjen
Proof-theoretic analysis of KPM. Arch. Math. Log. 30 (5-6) (1991)
Michael Rathjen
Ordinal notations based on a weakly Mahlo cardinal. Arch. Math. Log. 29 (4) (1990)