The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Rathjen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  26. A note on the Sigma1 spectrum of a theory. [Citation Graph (, )][DBLP]


  27. The strength of Martin-Löf type theory with a superuniverse. Part I. [Citation Graph (, )][DBLP]


  28. The strength of Martin-Löf type theory with a superuniverse. Part II. [Citation Graph (, )][DBLP]


  29. Reverse mathematics and well-ordering principles: A pilot study. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002