| Turing computations on ordinals P Koepke Bulletin of Symbolic Logic 11 (3), 377-397, 2005 | 115 | 2005 |
| The Naproche Project Controlled Natural Language Proof Checking of Mathematical Texts. M Cramer, B Fisseni, P Koepke, D Kühlwein, B Schröder, J Veldman CNL 5972, 170-186, 2009 | 79 | 2009 |
| Ordinal machines and admissible recursion theory P Koepke, B Seyfferth Annals of Pure and Applied Logic 160 (3), 310-318, 2009 | 62 | 2009 |
| Ordinal computability P Koepke Conference on Computability in Europe, 280-289, 2009 | 43 | 2009 |
| Register computations on ordinals P Koepke, R Siders Archive for Mathematical Logic 47 (6), 529-548, 2008 | 43 | 2008 |
| On the consistency strength of ‘accessible’Jónsson cardinals and of the weak chang conjecture HD Donder, P Koepke Annals of Pure and Applied Logic 25 (3), 233-261, 1983 | 41 | 1983 |
| An enhanced theory of infinite time register machines P Koepke, R Miller Logic and theory of Algorithms, 306-315, 2008 | 39 | 2008 |
| The basic theory of infinite time register machines M Carl, T Fischbach, P Koepke, R Miller, M Nasfi, G Weckbecker Archive for Mathematical Logic 49 (2), 249-273, 2010 | 35 | 2010 |
| Infinite time register machines P Koepke Logical approaches to computational barriers, 257-266, 2006 | 32 | 2006 |
| Superatomic Boolean algebras constructed from morasses P Koepke, JC Martínez The Journal of Symbolic Logic 60 (3), 940-951, 1995 | 30 | 1995 |
| Parsing and Disambiguation of Symbolic Mathematics in the Naproche System. M Cramer, P Koepke, B Schröder Calculemus/MKM, 180-195, 2011 | 27 | 2011 |
| The naproche system D Kühlwein, M Cramer, P Koepke, B Schröder Intelligent Computer Mathematics, Springer LNCS, ISBN, 978-3, 2009 | 27* | 2009 |
| The consistency strength of the free-subset property for ωω P Koepke The Journal of symbolic logic 49 (4), 1198-1204, 1984 | 26 | 1984 |
| THE CONSISTENCY STRENGTH OF THE FREE-SUBSET PROPERTY FOR tu P KOEPKE | 26* | 1984 |
| THE FREE-SUBSET PROPERTY FOR wco P KOEPKE | 26* | |
| Gödel’s Completeness Theorem1 P Braselmann, P Koepke Monatshefte für Mathematik und Physik 37, 349-360, 1930 | 24* | 1930 |
| Towards a Theory of Infinite Time Blum-Shub-Smale Machines. P Koepke, B Seyfferth CiE, 405-415, 2012 | 19 | 2012 |
| Premise Selection in the Naproche System. M Cramer, P Koepke, D Kühlwein, B Schröder IJCAR, 434-440, 2010 | 19 | 2010 |
| Some applications of short core models P Koepke Annals of pure and applied logic 37 (2), 179-204, 1988 | 18 | 1988 |
| Computing the recursive truth predicate on ordinal register machines P Koepke, R Siders Logical Approaches to Computational Barriers, Computer Science Report Series …, 2006 | 17 | 2006 |
