The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Koepke: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Koepke
    Computing a Model of Set Theory. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:223-232 [Conf]
  2. Peter Koepke
    Infinite Time Register Machines. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:257-266 [Conf]
  3. Peter Koepke, Ralf Schindler
    Homogeneously Souslin sets in small inner models. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2006, v:45, n:1, pp:53-61 [Journal]
  4. Arthur W. Apter, Peter Koepke
    The Consistency Strength of Àw and Àw1 Being Rowbottom Cardinals Without the Axiom of Choice. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2006, v:45, n:6, pp:721-737 [Journal]
  5. Peter Koepke
    Turing computations on ordinals. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2005, v:11, n:3, pp:377-397 [Journal]
  6. Sy D. Friedman, Peter Koepke
    An elementary approach to the fine structure of L. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1997, v:3, n:4, pp:453-468 [Journal]
  7. Peter Koepke
    The Consistency Strength of the Free-Subset Property for omegaomega. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:4, pp:1198-1204 [Journal]
  8. Peter Koepke
    Extenders, Embedding Normal Forms, and the Martin-Steel-Theorem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:3, pp:1137-1176 [Journal]
  9. Peter Koepke, Juan Carlos Martínez
    Superatomic Boolean Algebras Constructed from Morasses. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:3, pp:940-951 [Journal]
  10. Peter Koepke, Bernhard Schröder
    ProofML - eine Annotationssprache für natürliche Beweise. [Citation Graph (0, 0)][DBLP]
    LDV Forum, 2003, v:18, n:1/2, pp:428-441 [Journal]

  11. Premise Selection in the Naproche System. [Citation Graph (, )][DBLP]


  12. An Enhanced Theory of Infinite Time Register Machines. [Citation Graph (, )][DBLP]


  13. Ordinal Computability. [Citation Graph (, )][DBLP]


  14. The Naproche Project Controlled Natural Language Proof Checking of Mathematical Texts. [Citation Graph (, )][DBLP]


  15. Making all cardinals almost Ramsey. [Citation Graph (, )][DBLP]


  16. Register computations on ordinals. [Citation Graph (, )][DBLP]


  17. Ordinal machines and admissible recursion theory. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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