2008 |
29 | EE | Michael Rathjen:
The natural numbers in constructive set theory.
Math. Log. Q. 54(1): 83-97 (2008) |
2007 |
28 | EE | Michael Rathjen:
Theories and Ordinals: Ordinal Analysis.
CiE 2007: 632-637 |
27 | EE | Robert S. Lubarsky,
Michael Rathjen:
On the Constructive Dedekind Reals: Extended Abstract.
LFCS 2007: 349-362 |
2006 |
26 | EE | Michael Rathjen:
Models of Intuitionistic Set Theories over Partial Combinatory Algebras.
TAMC 2006: 68-78 |
25 | EE | Michael Rathjen,
Sergei Tupailo:
Characterizing the interpretation of set theory in Martin-Löf typetheory.
Ann. Pure Appl. Logic 141(3): 442-471 (2006) |
24 | EE | Michael Rathjen:
A note on Bar Induction in Constructive Set Theory.
Math. Log. Q. 52(3): 253-258 (2006) |
2005 |
23 | EE | Michael Rathjen:
Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory.
Ann. Pure Appl. Logic 136(1-2): 156-174 (2005) |
22 | EE | Michael Rathjen:
An ordinal analysis of stability.
Arch. Math. Log. 44(1): 1-62 (2005) |
21 | EE | Michael Rathjen:
An ordinal analysis of parameter free Pi12-comprehension.
Arch. Math. Log. 44(3): 263-362 (2005) |
20 | EE | Michael Rathjen:
Constructive Set Theory and Brouwerian Principles.
J. UCS 11(12): 2008-2033 (2005) |
2003 |
19 | EE | Michael Rathjen:
Realizing Mahlo set theory in type theory.
Arch. Math. Log. 42(1): 89-101 (2003) |
18 | EE | Michael Rathjen,
Robert S. Lubarsky:
On the regular extension axiom and its variants.
Math. Log. Q. 49(5): 511-518 (2003) |
2002 |
17 | | Laura Crosilla,
Michael Rathjen:
Inaccessible set axions may have little consistency strength.
Ann. Pure Appl. Logic 115(1-3): 33-70 (2002) |
16 | EE | Michael Möllerfeld,
Michael Rathjen:
A note on the Sigma1 spectrum of a theory.
Arch. Math. Log. 41(1): 33-34 (2002) |
2001 |
15 | EE | Michael Rathjen:
The strength of Martin-Löf type theory with a superuniverse. Part II.
Arch. Math. Log. 40(3): 207-233 (2001) |
14 | EE | Michael Rathjen:
Kripke-Platek Set Theory and the Anti-Foundation Axiom.
Math. Log. Q. 47(4): 435-440 (2001) |
2000 |
13 | EE | Michael Rathjen:
The strength of Martin-Löf type theory with a superuniverse. Part I.
Arch. Math. Log. 39(1): 1-39 (2000) |
1999 |
12 | | Michael Rathjen:
Explicit Mathematics with The Monotone Fixed Point Principle. II: Models.
J. Symb. Log. 64(2): 517-550 (1999) |
1998 |
11 | | Michael Rathjen,
Edward R. Griffor,
Erik Palmgren:
Inaccessibility in Constructive Set Theory and Type Theory.
Ann. Pure Appl. Logic 94(1-3): 181-200 (1998) |
10 | | Michael Rathjen:
Explicit Mathematics with the Monotone Fixed Point Principle.
J. Symb. Log. 63(2): 509-542 (1998) |
1997 |
9 | | Thomas Glaß,
Michael Rathjen,
Andreas Schlüter:
On the Proof-Theoretic Strength of Monotone Induction in Explicit Mathematics.
Ann. Pure Appl. Logic 85(1): 1-46 (1997) |
1996 |
8 | | Michael Rathjen:
Monotone Inductive Definitions in Explicit Mathematics.
J. Symb. Log. 61(1): 125-146 (1996) |
7 | | Michael Rathjen:
The Recursively Mahlo Property in Second Order Arithmetic.
Math. Log. Q. 42: 59-66 (1996) |
1995 |
6 | EE | Michael Rathjen:
Recent advances in ordinal analysis: pi12 -- CA and related systems.
Bulletin of Symbolic Logic 1(4): 468-485 (1995) |
1994 |
5 | | Michael Rathjen:
Proof Theory of Reflection.
Ann. Pure Appl. Logic 68(2): 181-224 (1994) |
1993 |
4 | | Michael Rathjen,
Andreas Weiermann:
Proof-Theoretic Investigations on Kruskal's Theorem.
Ann. Pure Appl. Logic 60(1): 49-88 (1993) |
3 | | Michael Rathjen:
How to Develop Proof-Theoretic Ordinal Functions on the Basis of Admissible Ordinals.
Math. Log. Q. 39: 47-54 (1993) |
1992 |
2 | | Michael Rathjen:
A Proof-Theoretic Characterization of the Primitive Recursive Set Functions.
J. Symb. Log. 57(3): 954-969 (1992) |
1991 |
1 | | Michael Rathjen:
The Role of Parameters in Bar Rule and Bar Induction.
J. Symb. Log. 56(2): 715-730 (1991) |