default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Koepke
Person information
- affiliation: University of Bonn, Mathematical Institute
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j27]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): 225-231 (2016)- 2014
- [j26]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): 471-486 (2014) - 2013
- [j25]Peter Koepke, Karen Räsch, Philipp Schlicht
:
A minimal Prikry-type forcing for singularizing a measurable cardinal. J. Symb. Log. 78(1): 85-100 (2013) - 2012
- [j24]Julian J. Schlöder, Peter Koepke:
Transition of Consistency and Satisfiability under Language Extensions. Formaliz. Math. 20(3): 193-197 (2012) - [j23]Julian J. Schlöder, Peter Koepke:
The Gödel Completeness Theorem for Uncountable Languages. Formaliz. Math. 20(3): 199-203 (2012) - 2011
- [j22]Peter Koepke, Philip D. Welch:
Global square and mutual stationarity at the alephn. Ann. Pure Appl. Log. 162(10): 787-806 (2011) - 2010
- [j21]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): 249-273 (2010) - [j20]Arthur W. Apter, Peter Koepke:
The consistency strength of choiceless failures of SCH. J. Symb. Log. 75(3): 1066-1080 (2010) - 2009
- [j19]Peter Koepke, Benjamin Seyfferth:
Ordinal machines and admissible recursion theory. Ann. Pure Appl. Log. 160(3): 310-318 (2009) - 2008
- [j18]Peter Koepke, Ryan Siders:
Register computations on ordinals. Arch. Math. Log. 47(6): 529-548 (2008) - [j17]Arthur W. Apter, Peter Koepke:
Making all cardinals almost Ramsey. Arch. Math. Log. 47(7-8): 769-783 (2008) - [j16]Peter Koepke, Ryan Siders:
Minimality considerations for ordinal computers modeling constructibility. Theor. Comput. Sci. 394(3): 197-207 (2008) - 2006
- [j15]Peter Koepke, Ralf Schindler:
Homogeneously Souslin sets in small inner models. Arch. Math. Log. 45(1): 53-61 (2006) - [j14]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) - [j13]Sy-David Friedman, Peter Koepke, Boris Piwinger:
Hyperfine structure theory and gap 1 morasses. J. Symb. Log. 71(2): 480-490 (2006) - [j12]Peter Koepke, Martin Koerwien:
Ordinal computations. Math. Struct. Comput. Sci. 16(5): 867-884 (2006) - 2005
- [j11]Peter Koepke:
Turing computations on ordinals. Bull. Symb. Log. 11(3): 377-397 (2005) - 2003
- [j10]Peter Koepke, Bernhard Schröder:
ProofML - eine Annotationssprache für natürliche Beweise. LDV Forum 18(1/2): 428-441 (2003) - 2002
- [j9]Peter Koepke:
The Category of Inner Models. Synth. 133(1-2): 275-303 (2002) - 1998
- [j8]Peter Koepke:
Extenders, Embedding Normal Forms, and the Martin-Steel-Theorem. J. Symb. Log. 63(3): 1137-1176 (1998) - 1997
- [j7]Sy D. Friedman, Peter Koepke:
An elementary approach to the fine structure of L. Bull. Symb. Log. 3(4): 453-468 (1997) - 1995
- [j6]Peter Koepke, Juan Carlos Martínez:
Superatomic Boolean Algebras Constructed from Morasses. J. Symb. Log. 60(3): 940-951 (1995) - 1989
- [j5]Peter Koepke:
On the free subset property at singular cardinals. Arch. Math. Log. 28(1): 43-55 (1989) - [j4]Peter Koepke:
On the elimination of Malitz quantifiers over Archimedian real closed fields. Arch. Math. Log. 28(3): 167-171 (1989) - 1988
- [j3]Peter Koepke:
Some applications of short core models. Ann. Pure Appl. Log. 37(2): 179-204 (1988) - 1984
- [j2]Peter Koepke:
The Consistency Strength of the Free-Subset Property for omegaomega. J. Symb. Log. 49(4): 1198-1204 (1984) - 1983
- [j1]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): 233-261 (1983)
Conference and Workshop Papers
- 2022
- [c20]Peter Koepke, Anton Lorenzen, Boris Shminke:
CICM'22 System Entries. CICM 2022: 344-348 - 2021
- [c19]Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Makarius Wenzel:
The Isabelle/Naproche Natural Language Proof Assistant. CADE 2021: 614-624 - [c18]Adrian De Lon, Peter Koepke, Anton Lorenzen:
A Natural Formalization of the Mutilated Checkerboard Problem in Naproche. ITP 2021: 16:1-16:11 - [c17]Peter Koepke, Dennis Müller:
Preface. CICM Workshops 2021 - [c16]Peter Koepke, Tim Lichtnau, Jonas Lippert:
Natural Typesetting of Naproche Formalizations in LaTeX (short paper). CICM Workshops 2021 - [c15]Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Erik Sturzenhecker:
Beautiful Formalizations in Isabelle/Naproche. CICM 2021: 19-31 - 2020
- [c14]Adrian De Lon, Peter Koepke, Anton Lorenzen:
Interpreting Mathematical Texts in Naproche-SAD. CICM 2020: 284-289 - 2019
- [c13]Peter Koepke:
Textbook Mathematics in the Naproche-SAD System. CICM Workshops 2019 - 2018
- [c12]Steffen Frerix, Peter Koepke:
Automatic Proof-Checking of Ordinary Mathematical Texts. CICM Workshops 2018 - 2012
- [c11]Peter Koepke, Benjamin Seyfferth:
Towards a Theory of Infinite Time Blum-Shub-Smale Machines. CiE 2012: 405-415 - 2011
- [c10]Peter Koepke, Philip D. Welch:
A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0. CiE 2011: 152-159 - [c9]Marcos Cramer, Peter Koepke, Bernhard Schröder:
Parsing and Disambiguation of Symbolic Mathematics in the Naproche System. Calculemus/MKM 2011: 180-195 - 2010
- [c8]Marcos Cramer, Peter Koepke, Daniel Kühlwein, Bernhard Schröder:
Premise Selection in the Naproche System. IJCAR 2010: 434-440 - 2009
- [c7]Peter Koepke:
Ordinal Computability. CiE 2009: 280-289 - [c6]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: 170-186 - [c5]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 - 2008
- [c4]Peter Koepke, Russell G. Miller:
An Enhanced Theory of Infinite Time Register Machines. CiE 2008: 306-315 - 2006
- [c3]Peter Koepke:
Infinite Time Register Machines. CiE 2006: 257-266 - 2005
- [c2]Peter Koepke:
Computing a Model of Set Theory. CiE 2005: 223-232 - 2001
- [c1]Peter Koepke, Marc van Eijmeren:
A refinement of Jensen's constructible hierarchy. FotFS 2001: 159-169
Editorship
- 2023
- [e1]Jasmin Blanchette, James H. Davenport, Peter Koepke, Michael Kohlhase, Andrea Kohlhase, Adam Naumowicz, Dennis Müller, Yasmine Sharoda, Claudio Sacerdoti Coen:
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. CEUR Workshop Proceedings 3377, CEUR-WS.org 2023 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
