Prof. Dr. Peter Koepke
Recent Preprints (published and unpublished)
In the Publication Process- (with Arthur Apter and Ioanna Dimitriou) The first measurable cardinal can be the first uncountable regular cardinal at any successor height. 12 pages. Submitted and in revision. pdf
- (with Vladimir Kanovei) Degrees of subsets of the measurable cardinal in Prikry generic extensions. 15 pages. Submitted. pdf
- (with Andrey Morozov) On the computational strength of Infinite Time Blum-Shub-Smale Machines. 26 pages.
- (with Karen Räsch and Philipp Schlicht) A minimal Prikry-type forcing for singularizing a measurable cardinal. The Journal of Symbolic Logic 78 (2013), 85-100. pdf
- (with Moti Gitik) Violating the singular cardinals hypothesis without large cardinals. Israel Journal of Mathematics 191 (2012), 901-922. pdf
- (with Benjamin Seyfferth) Towards a theory of infinite time Blum-Shub-Smale machines. Lecture Notes in Computer Science 7318 (2012). pdf
- (with Julian J. Schlöder) Transition of consistency and satisfiability under language extensions. Formalized Mathematics 20 (2012), 193-197.
- (with Julian J. Schlöder) The Gödel completeness theorem for uncountable languages. Formalized Mathematics 20 (2012), 199-203.
- (with Philip D. Welch) A generalised dynamical system, infinite time register machines, and Pi^1_1-CA_0. In CiE 2011. B. Löwe et al, eds., Lecture Notes in Computer Science 6735 (2011), 152-159. pdf
- (with Marcos Cramer and Bernhard Schröder) Parsing and disambiguation of symbolic mathematics in the Naproche system. In Calculemus/MKM 2011. J. H. Davenport et al, eds., Lecture Notes in Artificial Intelligence 6824 (2011), 180-195. pdf
- (with Philip Welch) Global square and mutual stationarity at the aleph_n. Annals of Pure and Applied Logic 162 (2011), 787-806 pdf
- (with Arthur Apter) The consistency strength of choiceless failures of SCH. The Journal of Symbolic Logic 75 (2010), 1066-1080. pdf
- (with Marcos Cramer, Daniel Kühlwein, and Bernhard Schröder) Premise Selection in the Naproche System. J. Giesl and Reiner Hähnle, eds., Lecture Notes in Computer Science 6173 (2010), 434-440. pdf
- (with Marcos Cramer, Bernhard Fisseni, Daniel Kühlwein, Bernhard Schröder, and Jip Veldman) The Naproche project - Controlled natural language proof checking of mathematical texts. N. Fuchs, ed., Lecture Notes in Computer Science 5972 (2010), 170-186. pdf
- (with Merlin Carl, Tim Fischbach, Russell Miller, Miriam Nasfi, and Gregor Weckbecker) The basic theory of infinite time register machines. Archive for Mathematical Logic 49 (2010) 2, 249-273. pdf
- (with Merlin Carl) Interpreting Naproche - An algorithmic approach to the derivation-indicator view. Alison Pease et. al., eds., Proceedings of the International Symposium on Mathematical Practice and Cognition. 7-10. pdf
- (with M. Cramer, D. Kühlwein, and B. Schröder) The Naproche System. Calculemus 2009 Emerging Trends (2009), Ontario, Canada, 10-20. pdf
- Ordinal computability. In Mathematical Theory and Computational Practice. K. Ambos-Spies et al, eds., Lecture Notes in Computer Science 5635 (2009), 280-289. pdf
- (with Benjamin Seyfferth) Ordinal machines and admissible recursion theory. Annals of Pure and Applied Logic, 160 (2009), 310-318. pdf
- (with M. Cramer, D. Kühlwein, and B. Schröder) From proof texts to logic. Discourse representation structures for proof texts in mathematics. In Von der Form zur Bedeutung: Texte automatisch verarbeiten. From Form to Meaning: Processing Texts Automatically. C. Chiarcos et al. eds. Verlag Narr, Tübingen. pdf
- (with Arthur Apter) Making all cardinals almost Ramsey. Archive for Mathematical Logic 47 (2008), 769-783. pdf
- (with Ryan Siders) Register computations on ordinals. Archive for Mathematical Logic 47 (2008), 529-548. pdf
- (with Ryan Siders) Minimality considerations for ordinal computers modeling constructibility. Theoretical Computer Science 394 (2008), 197-207. pdf
- (with Russell Miller) An enhanced theory of infinite time register machines. In Logic and Theory of Algorithms. A. Beckmann et al, eds., Lecture Notes in Computer Science 5028 (2008), 306-315 pdf
- Gödel's completeness theorem with natural language formulas. In Logik, Begriffe, Prinzipien des Handelns - Logic, Concepts, Principles of Action, Thomas Müller and Albert Newen, eds., mentis, Paderborn (2007), 49-63 pdf
- Forcing a mutual stationarity property in cofinality omega_1. Proceedings of the American Mathematical Society 135 (2007), 1523-1533 pdf
- alpha-Recursion theory and ordinal computability. In BIWOC - Bonn International Workshop on Ordinal Computability, Ioanna Dimitriou, Joel Hamkins, and Peter Koepke, eds., Bonn Logic Reports (2007), 48-55 pdf
- Ordinalize! In BIWOC - Bonn International Workshop on Ordinal Computability, Ioanna Dimitriou, Joel Hamkins, and Peter Koepke, eds., Bonn Logic Reports (2007), 21-26 pdf
- (with A. Apter) The consistency strength of Aleph_omega and Aleph_omega_1 being Rowbottom cardinals without the axiom of choice. Archive for Mathematical Logic 45 (2006), 721-737 pdf
- (with Sy D. Friedman and Boris Piwinger) Hyperfine structure theory and gap 1 morasses. Journal of Symbolic Logic 71 (2006), 480-490 pdf
- Computing a model of set theory. In New Computational Paradigms. S. Barry Cooper et al, eds., Lecture Notes in Computer Science 3988 (2006), 223-232 pdf
- (with Philip Welch) On the strength of mutual stationarity. In Set Theory. Centre de Recerca Matematica. Barcelona, 2003-2004. Joan Bagaria and Stevo Todorcevic, eds., Birkhäuser (2006), 309-320 pdf
- (with Martin Koerwien) Ordinal computations. Mathematical Structures in Computer Science 5 (2006), 867-884 pdf
- Ordinals, computations, and models of set theory. textos de matematica (Universidade de Coimbra) 38 (2006), 43-78 pdf
- Infinite time register machines. In Logical Approaches to Computational Barriers, Arnold Beckmann et al., eds., Lecture Notes in Computer Science 3988 (2006), 257-266 pdf
- (with Ryan Siders) Computing the recursive truth predicate on ordinal register machines. In Logical Approaches to Computational Barriers, Arnold Beckmann et al., eds., Computer Science Report Series 7 (2006), Swansea, 160-169 pdf
Last changed: 101004