Peter Koepke

According to our database, Peter Koepke authored at least 47 papers between 1983 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

CICM'22 System Entries.

Peter Koepke, Anton Lorenzen, Boris Shminke

Proceedings of the Intelligent Computer Mathematics - 15th International Conference, 2022

2021

Beautiful Formalizations in Isabelle/Naproche.

Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Erik Sturzenhecker

Proceedings of the Intelligent Computer Mathematics - 14th International Conference, 2021

Natural Typesetting of Naproche Formalizations in LaTeX (short paper).

Peter Koepke, Tim Lichtnau, Jonas Lippert

Proceedings of the Joint Proceedings of the FMM, FVPS, MathUI,NatFoM, and OpenMath Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2021 co-located with the 14th Conference on Intelligent Computer Mathematics (CICM 2021), Virtual Event, Timisoara, Romania, July 26, 2021

Preface.

Peter Koepke, Dennis Müller

Proceedings of the Joint Proceedings of the FMM, FVPS, MathUI,NatFoM, and OpenMath Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2021 co-located with the 14th Conference on Intelligent Computer Mathematics (CICM 2021), Virtual Event, Timisoara, Romania, July 26, 2021

A Natural Formalization of the Mutilated Checkerboard Problem in Naproche.

Adrian De Lon, Peter Koepke, Anton Lorenzen

Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

The Isabelle/Naproche Natural Language Proof Assistant.

Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Makarius Wenzel

Proceedings of the Automated Deduction - CADE 28, 2021

2020

Interpreting Mathematical Texts in Naproche-SAD.

Adrian De Lon, Peter Koepke, Anton Lorenzen

Proceedings of the Intelligent Computer Mathematics - 13th International Conference, 2020

2019

Textbook Mathematics in the Naproche-SAD System.

Peter Koepke

Proceedings of the Joint Proceedings of the FMM and LML Workshops, 2019

2018

Automatic Proof-Checking of Ordinary Mathematical Texts.

Steffen Frerix, Peter Koepke

Proceedings of the Joint Proceedings of the CME-EI, 2018

2016

All uncountable cardinals in the Gitik model are almost Ramsey and carry Rowbottom filters.

Arthur W. Apter, Ioanna M. Dimitriou, Peter Koepke

Math. Log. Q., 2016

2014

The first measurable cardinal can be the first uncountable regular cardinal at any successor height.

Arthur W. Apter, Ioanna M. Dimitriou, Peter Koepke

Math. Log. Q., 2014

2013

A minimal Prikry-type forcing for singularizing a measurable cardinal.

Peter Koepke, Karen Räsch, Philipp Schlicht

J. Symb. Log., 2013

2012

The Gödel Completeness Theorem for Uncountable Languages.

Julian J. Schlöder, Peter Koepke

Formaliz. Math., 2012

Transition of Consistency and Satisfiability under Language Extensions.

Julian J. Schlöder, Peter Koepke

Formaliz. Math., 2012

Towards a Theory of Infinite Time Blum-Shub-Smale Machines.

Peter Koepke, Benjamin Seyfferth

Proceedings of the How the World Computes, 2012

2011

Global square and mutual stationarity at the aleph_n.

Peter Koepke, Philip D. Welch

Ann. Pure Appl. Log., 2011

Parsing and Disambiguation of Symbolic Mathematics in the Naproche System.

Marcos Cramer, Peter Koepke, Bernhard Schröder

Proceedings of the Intelligent Computer Mathematics - 18th Symposium, 2011

A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0.

Peter Koepke, Philip D. Welch

Proceedings of the Models of Computation in Context, 2011

2010

The consistency strength of choiceless failures of SCH.

Arthur W. Apter, Peter Koepke

J. Symb. Log., 2010

The basic theory of infinite time register machines.

Merlin Carl, Tim Fischbach, Peter Koepke, Russell G. Miller, Miriam Nasfi, Gregor Weckbecker

Arch. Math. Log., 2010

Premise Selection in the Naproche System.

Marcos Cramer, Peter Koepke, Daniel Kühlwein, Bernhard Schröder

Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2009

Ordinal machines and admissible recursion theory.

Peter Koepke, Benjamin Seyfferth

Ann. Pure Appl. Log., 2009

The Naproche Project: Controlled Natural Language Proof Checking of Mathematical Texts.

Marcos Cramer, Peter Koepke, Daniel Kühlwein, Bernhard Schröder, Jip Veldman

Proceedings of the Pre-Proceedings of the Workshop on Controlled Natural Language (CNL 2009), 2009

The Naproche Project Controlled Natural Language Proof Checking of Mathematical Texts.

Marcos Cramer, Bernhard Fisseni, Peter Koepke, Daniel Kühlwein, Bernhard Schröder, Jip Veldman

Proceedings of the Controlled Natural Language, Workshop on Controlled Natural Language, 2009

Ordinal Computability.

Peter Koepke

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Minimality considerations for ordinal computers modeling constructibility.

Peter Koepke, Ryan Siders

Theor. Comput. Sci., 2008

Register computations on ordinals.

Peter Koepke, Ryan Siders

Arch. Math. Log., 2008

Making all cardinals almost Ramsey.

Arthur W. Apter, Peter Koepke

Arch. Math. Log., 2008

An Enhanced Theory of Infinite Time Register Machines.

Peter Koepke, Russell G. Miller

Proceedings of the Logic and Theory of Algorithms, 2008

2006

Ordinal computations.

Peter Koepke, Martin Koerwien

Math. Struct. Comput. Sci., 2006

Hyperfine structure theory and gap 1 morasses.

Sy-David Friedman, Peter Koepke, Boris Piwinger

J. Symb. Log., 2006

Homogeneously Souslin sets in small inner models.

Peter Koepke, Ralf Schindler

Arch. Math. Log., 2006

The Consistency Strength of À_w and À_w₁ Being Rowbottom Cardinals Without the Axiom of Choice.

Arthur W. Apter, Peter Koepke

Arch. Math. Log., 2006

Infinite Time Register Machines.

Peter Koepke

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Turing computations on ordinals.

Peter Koepke

Bull. Symb. Log., 2005

Computing a Model of Set Theory.

Peter Koepke

Proceedings of the New Computational Paradigms, 2005

2003

ProofML - eine Annotationssprache für natürliche Beweise.

Peter Koepke, Bernhard Schröder

LDV Forum, 2003

2002

The Category of Inner Models.

Peter Koepke

Synth., 2002

2001

A refinement of Jensen's constructible hierarchy.

Peter Koepke, Marc van Eijmeren

Proceedings of the Classical and New Paradigms of Computation and their Complexity Hierarchies, 2001

1998

Extenders, Embedding Normal Forms, and the Martin-Steel-Theorem.

Peter Koepke

J. Symb. Log., 1998

1997

An elementary approach to the fine structure of L.

Sy D. Friedman, Peter Koepke

Bull. Symb. Log., 1997

1995

Superatomic Boolean Algebras Constructed from Morasses.

Peter Koepke, Juan Carlos Martínez

J. Symb. Log., 1995

1989

On the elimination of Malitz quantifiers over Archimedian real closed fields.

Peter Koepke

Arch. Math. Log., 1989

On the free subset property at singular cardinals.

Peter Koepke

Arch. Math. Log., 1989

1988

Some applications of short core models.

Peter Koepke

Ann. Pure Appl. Log., 1988

1984

The Consistency Strength of the Free-Subset Property for omega_omega.

Peter Koepke

J. Symb. Log., 1984

1983

On the consistency strength of 'Accessible' Jonsson Cardinals and of the Weak Chang Conjecture.

Hans-Dieter Donder, Peter Koepke

Ann. Pure Appl. Log., 1983