2008 |
15 | EE | Peter Koepke,
Russell Miller:
An Enhanced Theory of Infinite Time Register Machines.
CiE 2008: 306-315 |
14 | EE | Peter Koepke,
Ryan Siders:
Register computations on ordinals.
Arch. Math. Log. 47(6): 529-548 (2008) |
13 | EE | Arthur W. Apter,
Peter Koepke:
Making all cardinals almost Ramsey.
Arch. Math. Log. 47(7-8): 769-783 (2008) |
12 | EE | Peter Koepke,
Ryan Siders:
Minimality considerations for ordinal computers modeling constructibility.
Theor. Comput. Sci. 394(3): 197-207 (2008) |
2006 |
11 | EE | Peter Koepke:
Infinite Time Register Machines.
CiE 2006: 257-266 |
10 | EE | Peter Koepke,
Ralf Schindler:
Homogeneously Souslin sets in small inner models.
Arch. Math. Log. 45(1): 53-61 (2006) |
9 | EE | Arthur W. Apter,
Peter Koepke:
The Consistency Strength of Àw and Àw1 Being Rowbottom Cardinals Without the Axiom of Choice.
Arch. Math. Log. 45(6): 721-737 (2006) |
8 | EE | Peter Koepke,
Martin Koerwien:
Ordinal computations.
Mathematical Structures in Computer Science 16(5): 867-884 (2006) |
2005 |
7 | EE | Peter Koepke:
Computing a Model of Set Theory.
CiE 2005: 223-232 |
6 | EE | Peter Koepke:
Turing computations on ordinals.
Bulletin of Symbolic Logic 11(3): 377-397 (2005) |
2003 |
5 | EE | Peter Koepke,
Bernhard Schröder:
ProofML - eine Annotationssprache für natürliche Beweise.
LDV Forum 18(1/2): 428-441 (2003) |
1998 |
4 | | Peter Koepke:
Extenders, Embedding Normal Forms, and the Martin-Steel-Theorem.
J. Symb. Log. 63(3): 1137-1176 (1998) |
1997 |
3 | EE | Sy D. Friedman,
Peter Koepke:
An elementary approach to the fine structure of L.
Bulletin of Symbolic Logic 3(4): 453-468 (1997) |
1995 |
2 | | Peter Koepke,
Juan Carlos Martínez:
Superatomic Boolean Algebras Constructed from Morasses.
J. Symb. Log. 60(3): 940-951 (1995) |
1984 |
1 | | Peter Koepke:
The Consistency Strength of the Free-Subset Property for omegaomega.
J. Symb. Log. 49(4): 1198-1204 (1984) |