Peter Koepke - RankMe

51 papers A 2B 2C 11Journal 27Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	C	`ed.`	Intelligent Computer Mathematics - 18th International Conference, CICM 2025, Brasilia, Brazil, October 6-10, 2025, Proceedings CICM Valeria de Paiva, Peter Koepke
2025	B	`conf`	A Natural Language Formalization of Perfectoid Rings in ℕaproche. ITP Peter Koepke
2025	C	`conf`	Formalizing the Solow Model in $\mathbb {N}$aproche. CICM Peter Koepke, Patrick Schäfer
2023	—	`ed.`	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 - 31, 2021. CICM Workshops Jasmin Blanchette, James H. Davenport, Peter Koepke, Michael Kohlhase, Andrea Kohlhase, Adam Naumowicz, Dennis Müller, Yasmine Sharoda, Claudio Sacerdoti Coen
2022	C	`conf`	CICM'22 System Entries. CICM Peter Koepke, Anton Lorenzen, Boris Shminke
2021	B	`conf`	A Natural Formalization of the Mutilated Checkerboard Problem in Naproche. ITP Adrian De Lon, Peter Koepke, Anton Lorenzen
2021	C	`conf`	Beautiful Formalizations in Isabelle/Naproche. CICM Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Erik Sturzenhecker
2021	—	`conf`	Natural Typesetting of Naproche Formalizations in LaTeX (short paper). CICM Workshops Peter Koepke, Tim Lichtnau, Jonas Lippert
2021	—	`conf`	Preface. CICM Workshops Peter Koepke, Dennis Müller
2021	A	`conf`	The Isabelle/Naproche Natural Language Proof Assistant. CADE Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Makarius Wenzel
2020	C	`conf`	Interpreting Mathematical Texts in Naproche-SAD. CICM Adrian De Lon, Peter Koepke, Anton Lorenzen
2019	—	`conf`	Textbook Mathematics in the Naproche-SAD System. CICM Workshops Peter Koepke
2018	—	`conf`	Automatic Proof-Checking of Ordinary Mathematical Texts. CICM Workshops Steffen Frerix, Peter Koepke
2016	J	`jnl`	All uncountable cardinals in the Gitik model are almost Ramsey and carry Rowbottom filters. Math. Log. Q. Arthur W. Apter, Ioanna M. Dimitriou, Peter Koepke
2014	J	`jnl`	The first measurable cardinal can be the first uncountable regular cardinal at any successor height. Math. Log. Q. Arthur W. Apter, Ioanna M. Dimitriou, Peter Koepke
2013	J	`jnl`	A minimal Prikry-type forcing for singularizing a measurable cardinal. J. Symb. Log. Peter Koepke, Karen Räsch, Philipp Schlicht
2012	J	`jnl`	The Gödel Completeness Theorem for Uncountable Languages. Formaliz. Math. Julian J. Schlöder, Peter Koepke
2012	C	`conf`	Towards a Theory of Infinite Time Blum-Shub-Smale Machines. CiE Peter Koepke, Benjamin Seyfferth
2012	J	`jnl`	Transition of Consistency and Satisfiability under Language Extensions. Formaliz. Math. Julian J. Schlöder, Peter Koepke
2011	C	`conf`	A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0. CiE Peter Koepke, Philip D. Welch
2011	J	`jnl`	Global square and mutual stationarity at the aleph Ann. Pure Appl. Log. Peter Koepke, Philip D. Welch
2011	—	`conf`	Parsing and Disambiguation of Symbolic Mathematics in the Naproche System. Calculemus/MKM Marcos Cramer, Peter Koepke, Bernhard Schröder
2010	A	`conf`	Premise Selection in the Naproche System. IJCAR Marcos Cramer, Peter Koepke, Daniel Kühlwein, Bernhard Schröder
2010	J	`jnl`	The basic theory of infinite time register machines. Arch. Math. Log. Merlin Carl, Tim Fischbach, Peter Koepke, Russell G. Miller, Miriam Nasfi, Gregor Weckbecker
2010	J	`jnl`	The consistency strength of choiceless failures of SCH. J. Symb. Log. Arthur W. Apter, Peter Koepke
2009	C	`conf`	Ordinal Computability. CiE Peter Koepke
2009	J	`jnl`	Ordinal machines and admissible recursion theory. Ann. Pure Appl. Log. Peter Koepke, Benjamin Seyfferth
2009	—	`conf`	The Naproche Project Controlled Natural Language Proof Checking of Mathematical Texts. CNL Marcos Cramer, Bernhard Fisseni, Peter Koepke, Daniel Kühlwein, Bernhard Schröder, Jip Veldman
2009	—	`conf`	The Naproche Project: Controlled Natural Language Proof Checking of Mathematical Texts. CNL (Pre-Proceedings) Marcos Cramer, Peter Koepke, Daniel Kühlwein, Bernhard Schröder, Jip Veldman
2008	C	`conf`	An Enhanced Theory of Infinite Time Register Machines. CiE Peter Koepke, Russell G. Miller
2008	J	`jnl`	Making all cardinals almost Ramsey. Arch. Math. Log. Arthur W. Apter, Peter Koepke
2008	J	`jnl`	Minimality considerations for ordinal computers modeling constructibility. Theor. Comput. Sci. Peter Koepke, Ryan Siders
2008	J	`jnl`	Register computations on ordinals. Arch. Math. Log. Peter Koepke, Ryan Siders
2006	J	`jnl`	Homogeneously Souslin sets in small inner models. Arch. Math. Log. Peter Koepke, Ralf Schindler
2006	J	`jnl`	Hyperfine structure theory and gap 1 morasses. J. Symb. Log. Sy-David Friedman, Peter Koepke, Boris Piwinger
2006	C	`conf`	Infinite Time Register Machines. CiE Peter Koepke
2006	J	`jnl`	Ordinal computations. Math. Struct. Comput. Sci. Peter Koepke, Martin Koerwien
2006	J	`jnl`	The Consistency Strength of À Arch. Math. Log. Arthur W. Apter, Peter Koepke
2005	C	`conf`	Computing a Model of Set Theory. CiE Peter Koepke
2005	J	`jnl`	Turing computations on ordinals. Bull. Symb. Log. Peter Koepke
2003	J	`jnl`	ProofML - eine Annotationssprache für natürliche Beweise. LDV Forum Peter Koepke, Bernhard Schröder
2002	J	`jnl`	The Category of Inner Models. Synth. Peter Koepke
2001	—	`conf`	A refinement of Jensen's constructible hierarchy. FotFS Peter Koepke, Marc van Eijmeren
1998	J	`jnl`	Extenders, Embedding Normal Forms, and the Martin-Steel-Theorem. J. Symb. Log. Peter Koepke
1997	J	`jnl`	An elementary approach to the fine structure of L. Bull. Symb. Log. Sy D. Friedman, Peter Koepke
1995	J	`jnl`	Superatomic Boolean Algebras Constructed from Morasses. J. Symb. Log. Peter Koepke, Juan Carlos Martínez
1989	J	`jnl`	On the elimination of Malitz quantifiers over Archimedian real closed fields. Arch. Math. Log. Peter Koepke
1989	J	`jnl`	On the free subset property at singular cardinals. Arch. Math. Log. Peter Koepke
1988	J	`jnl`	Some applications of short core models. Ann. Pure Appl. Log. Peter Koepke
1984	J	`jnl`	The Consistency Strength of the Free-Subset Property for omega J. Symb. Log. Peter Koepke
1983	J	`jnl`	On the consistency strength of 'Accessible' Jonsson Cardinals and of the Weak Chang Conjecture. Ann. Pure Appl. Log. Hans-Dieter Donder, Peter Koepke