Publications
Publications
Koepke, Peter
References
46.
Peter Koepke and Benjamin Seyfferth
Towards a theory of infinite time Blum-Shub-Smale machines
How the world computes Volume 7318 of Lecture Notes in Comput. Sci.
page 405--415.
Publisher: Springer, Heidelberg,
2012
45.
P. Koepke and P. D. Welch
Global square and mutual stationarity at the {\aleph_n}
Ann. Pure Appl. Logic, 162(10):787--806
2011
44.
Peter Koepke and Philip D. Welch
A generalised dynamical system, infinite time register machines, and {\Pi_1^1\text-CA_0}
Models of computation in context Volume 6735 of Lecture Notes in Comput. Sci.
page 152--159.
Publisher: Springer, Heidelberg,
2011
43.
Marcos Cramer, Peter Koepke and Bernhard Schröder
Parsing and disambiguation of symbolic mathematics in the Naproche system
Intelligent Computer Mathematics Volume 6824 of Lecture Notes in Artificial Intelligence
page 180--195.
Publisher: Springer, Heidelberg,
2011
42.
Merlin Carl, Tim Fischbach, Peter Koepke, Russell Miller, Miriam Nasfi and Gregor Weckbecker
The basic theory of infinite time register machines
Arch. Math. Logic, 49(2):249--273
2010
41.
Arthur W. Apter and Peter Koepke
The consistency strength of choiceless failures of SCH
J. Symbolic Logic, 75(3):1066--1080
2010
40.
Marcos Cramer, Peter Koepke, Daniel Kühlwein and Bernhard Schröder
Premise selection in the Naproche system
Automated Reasoning Volume 6173 of Lecture Notes in Computer Science
page 434--440.
Publisher: Springer, Heidelberg,
2010
39.
Marcos Cramer, Bernhard Fisseni, Peter Koepke, Daniel Kühlwein, Bernhard Schröder and Jip Veldman
The Naproche project - Controlled natural language proof checking of mathematical texts
Controlled Natural Language Volume 5972 of Lecture Notes in Computer Science
page 170--186.
Publisher: Springer, Heidelberg,
2010
38.
Peter Koepke and Benjamin Seyfferth
Ordinal machines and admissible recursion theory
Ann. Pure Appl. Logic, 160(3):310--318
2009
37.
Bernhard Fisseni, Peter Koepke, Bernhard Schröder and Jip Veldman
From Form to Meaning: Processing Texts Automatically
In Christian Chiarcos, Richard Eckart de Castilho and Manfred Stede, editor,
Chapter From proof texts to logic : discourse representation structures for proof texts inmathematics, page 137--145.
Publisher: Günter Narr, Tübingen,
2009
36.
Peter Koepke
Ordinal computability
Mathematical theory and computational practice Volume 5635 of Lecture Notes in Comput. Sci.
page 280--289.
Publisher: Springer, Berlin,
2009
35.
Arthur W. Apter and Peter Koepke
Making all cardinals almost Ramsey
Arch. Math. Logic, 47(7-8):769--783
2008
Page:  
Export as:
BibTeX, XML