Peter Koepke

Publication Activity (10 Years)

Years Active: 1983-2022
Publications (10 Years): 10

Top Topics

Logical Language

Connected Regions

Text Generation

Top Venues

Publications

Peter Koepke, Anton Lorenzen, Boris Shminke
CICM'22 System Entries. CICM (2022)
Peter Koepke, Dennis Müller
Preface. CICM Workshops (2021)
Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Makarius Wenzel
The Isabelle/Naproche Natural Language Proof Assistant. CADE (2021)
Peter Koepke, Tim Lichtnau, Jonas Lippert
Natural Typesetting of Naproche Formalizations in LaTeX (short paper). CICM Workshops (2021)
Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Erik Sturzenhecker
Beautiful Formalizations in Isabelle/Naproche. CICM (2021)
Adrian De Lon, Peter Koepke, Anton Lorenzen
A Natural Formalization of the Mutilated Checkerboard Problem in Naproche. ITP (2021)
Adrian De Lon, Peter Koepke, Anton Lorenzen
Interpreting Mathematical Texts in Naproche-SAD. CICM (2020)
Peter Koepke
Textbook Mathematics in the Naproche-SAD System. CICM Workshops (2019)
Steffen Frerix, Peter Koepke
Automatic Proof-Checking of Ordinary Mathematical Texts. CICM Workshops (2018)
Arthur W. Apter, Ioanna M. Dimitriou, Peter Koepke
All uncountable cardinals in the Gitik model are almost Ramsey and carry Rowbottom filters. Math. Log. Q. 62 (3) (2016)
Arthur W. Apter, Ioanna M. Dimitriou, Peter Koepke
The first measurable cardinal can be the first uncountable regular cardinal at any successor height. Math. Log. Q. 60 (6) (2014)
Peter Koepke, Karen Räsch, Philipp Schlicht
A minimal Prikry-type forcing for singularizing a measurable cardinal. J. Symb. Log. 78 (1) (2013)
Julian J. Schlöder, Peter Koepke
The Gödel Completeness Theorem for Uncountable Languages. Formaliz. Math. 20 (3) (2012)
Peter Koepke, Benjamin Seyfferth
Towards a Theory of Infinite Time Blum-Shub-Smale Machines. CiE (2012)
Julian J. Schlöder, Peter Koepke
Transition of Consistency and Satisfiability under Language Extensions. Formaliz. Math. 20 (3) (2012)
Marcos Cramer, Peter Koepke, Bernhard Schröder
Parsing and Disambiguation of Symbolic Mathematics in the Naproche System. Calculemus/MKM (2011)
Peter Koepke, Philip D. Welch
A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0. CiE (2011)
Peter Koepke, Philip D. Welch
. Ann. Pure Appl. Log. 162 (10) (2011)
Merlin Carl, Tim Fischbach, Peter Koepke, Russell G. Miller, Miriam Nasfi, Gregor Weckbecker
The basic theory of infinite time register machines. Arch. Math. Log. 49 (2) (2010)
Marcos Cramer, Peter Koepke, Daniel Kühlwein, Bernhard Schröder
Premise Selection in the Naproche System. IJCAR (2010)
Arthur W. Apter, Peter Koepke
The consistency strength of choiceless failures of SCH. J. Symb. Log. 75 (3) (2010)
Peter Koepke, Benjamin Seyfferth
Ordinal machines and admissible recursion theory. Ann. Pure Appl. Log. 160 (3) (2009)
Marcos Cramer, Bernhard Fisseni, Peter Koepke, Daniel Kühlwein, Bernhard Schröder, Jip Veldman
The Naproche Project Controlled Natural Language Proof Checking of Mathematical Texts. CNL (2009)
Peter Koepke
Ordinal Computability. CiE (2009)
Marcos Cramer, Peter Koepke, Daniel Kühlwein, Bernhard Schröder, Jip Veldman
The Naproche Project: Controlled Natural Language Proof Checking of Mathematical Texts. CNL (Pre-Proceedings) (2009)
Arthur W. Apter, Peter Koepke
Making all cardinals almost Ramsey. Arch. Math. Log. 47 (7-8) (2008)
Peter Koepke, Russell G. Miller
An Enhanced Theory of Infinite Time Register Machines. CiE (2008)
Peter Koepke, Ryan Siders
Minimality considerations for ordinal computers modeling constructibility. Theor. Comput. Sci. 394 (3) (2008)
Peter Koepke, Ryan Siders
Register computations on ordinals. Arch. Math. Log. 47 (6) (2008)
Peter Koepke, Martin Koerwien
Ordinal computations. Math. Struct. Comput. Sci. 16 (5) (2006)
Peter Koepke, Ralf Schindler
Homogeneously Souslin sets in small inner models. Arch. Math. Log. 45 (1) (2006)
Arthur W. Apter, Peter Koepke
Being Rowbottom Cardinals Without the Axiom of Choice. Arch. Math. Log. 45 (6) (2006)
Peter Koepke
Infinite Time Register Machines. CiE (2006)
Sy-David Friedman, Peter Koepke, Boris Piwinger
Hyperfine structure theory and gap 1 morasses. J. Symb. Log. 71 (2) (2006)
Peter Koepke
Turing computations on ordinals. Bull. Symb. Log. 11 (3) (2005)
Peter Koepke
Computing a Model of Set Theory. CiE (2005)
Peter Koepke, Bernhard Schröder
ProofML - eine Annotationssprache für natürliche Beweise. LDV Forum 18 (1/2) (2003)
Peter Koepke
The Category of Inner Models. Synth. 133 (1-2) (2002)
Peter Koepke, Marc van Eijmeren
A refinement of Jensen's constructible hierarchy. FotFS (2001)
Peter Koepke
Extenders, Embedding Normal Forms, and the Martin-Steel-Theorem. J. Symb. Log. 63 (3) (1998)
Sy D. Friedman, Peter Koepke
An elementary approach to the fine structure of L. Bull. Symb. Log. 3 (4) (1997)
Peter Koepke, Juan Carlos Martínez
Superatomic Boolean Algebras Constructed from Morasses. J. Symb. Log. 60 (3) (1995)
Peter Koepke
On the elimination of Malitz quantifiers over Archimedian real closed fields. Arch. Math. Log. 28 (3) (1989)
Peter Koepke
On the free subset property at singular cardinals. Arch. Math. Log. 28 (1) (1989)
Peter Koepke
Some applications of short core models. Ann. Pure Appl. Log. 37 (2) (1988)
Peter Koepke
. J. Symb. Log. 49 (4) (1984)
Hans-Dieter Donder, Peter Koepke
On the consistency strength of 'Accessible' Jonsson Cardinals and of the Weak Chang Conjecture. Ann. Pure Appl. Log. 25 (3) (1983)