## Prof. Dr. Peter Koepke

## Recent Talks

**2011**

- Violating the singular cardinals hypothesis without large cardinals.
*CUNY Logic Workshop*New York, November 18, 2011 pdf - Felix Hausdorff and the foundations of mathematics. Amsterdam, September 20, 2011 pdf
- Formal Mathematics and Mathematical Practice.
*14th Congress of Logic, Methodology, and Philosophy of Science*Nancy, July 22, 2011 pdf - Natural Proof Checking: The Naproche Project.
*Logic Colloquium 2011*Barcelona, July 12, 2011 pdf - Techniques for getting large cardinals in inner models (Tutorial).
*PhDs in Logic III*Brussels, February 16 and 17, 2011 pdf - Formal Mathematics and Controlled Natural Language.
*Oberseminar Diskrete Optimierung*Bonn, February 14, 2011 and*Philosophy Seminar*Bristol, March 3, 2011 pdf

**2010**

- Combining linguistics and proof checking of mathematical texts.
*Philosophy of Mathematical Practice*Brussels, December 9, 2010 pdf - Violating the singular cardinals hypothesis without large cardinals. Bristol, November 29, 2010 pdf
- Checking natural language proofs.
*Meeting in Honor of Jouko Väänänen's Sixtieth Birthday*Helsinki, September 16, 2010 pdf - Ordinal Oriented Set Theory.
*Set Theory, Classical and Constructive*Amsterdam, May 7, 2010 pdf - It is relatively consistent that the infinite cardinals are alternately regular and singular.
*Amsterdam workshop in set theory*Amsterdam, June 2, 2010 pdf

**2009**

- Mathematical Proofs as Derivation-Indicators: Theory and Implementation. Seminar on the Philosophy of Mathematics, Utrecht, November 3, 2009 pdf
- Understanding natural language mathematical proofs. CUNY Graduate Center, New York, September 4, 2009 and Oberseminar Mathematische Logik, München, October 16, 2009 pdf
- Effectively Computable Ordinal Functions.
*EMU 2009*CUNY, New York, August 18, 2009 pdf - Ordinal Computability.
*CiE 2009*Heidelberg, July 23, 2009 pdf - Two Streams in the Philosophy of Mathematics: Rival Conceptions of Mathematical Proof University of Hertfordshire, July 2, 2009 pdf

**2008**

- Felix Hausdorff and the early development of descriptive set theory. IIT Kanpur, September 25, 2008 pdf
- Computations on Ordinals. IMSC, Chennai, September 16, 2008 pdf
- Felix Hausdorff und die Grundlagenproblematik der Mathematik. Kaiserslautern, November 24, 2008, pdf
- Ordinal Computability.
*EMU - Effective Mathematics of the Uncountable*, CUNY Graduate Center, New York, August 4, 2008, pdf - Eine mathematische Reise ins Unendliche.
*6. Bonner Wissenschaftsnacht*, July 4, 2008, pdf - Mathematische Beweise.
*Schülerinnen- und Schülertag des Hausdorff Center for Mathematics*, Bonn, May 16, 2008, pdf - Das zehnte Hilbertsche Problem und die Gödelschen Sätze.
*Cusanuswerk, Fachschaftstagung Mathematik-Informatik*, Uder, May 1 to 4, 2008, pdf - Submodels of Prikry generic extensions.
*CUNY Logic Workshop*at New York City, April 4, 2008, pdf - A finestructural refinement of the
*J*-hierarchy for extender models.*ASL Annual Meeting*, Irvine, March 28, 2008, pdf - Building the Dodd-Jensen core model with a simplified fine hierarchy.
*Stanford Logic Seminar*, Stanford, March 25, 2008, pdf

**2007**

- The NAPROCHE project.
*Workshop Deduction in Semantics*at Stuttgart, October 11, 2007, pdf - Sets in Prikry extensions.
*Set Theory Meeting*, ILLC Amsterdam, August 13, 2007, and*Informal Meeting*, Paris, September 29, 2007 pdf - Ordinal Computability Theory.
*1st European Set Theory Meeting*at Bedlewo, Poland, July 10, 2007, pdf - Second Order Arithmetic, Topological Regularity Properties, and
Zermelo-Fraenkel Set Theory.
*Trimestre on Methods of Proof Theory in Mathematics*, Bonn, June 7, 2007, pdf - Unendlichkeit und absolute Unentscheidbarkeit - Paul Cohen
1934-2007.
*Dies Academicus*, Bonn, May 23, 2007, pdf - Almost Ramsey Cardinals.
*Informal Meeting of Set Theorists 2007*, Bonn, May 17, 2007, pdf - The Language of Proofs.
*Trimestre on Methods of Proof Theory in Mathematics*, Bonn, March 22, 2007, pdf - Ordinalize!
*BIWOC - Bonn International Workshop on Ordinal Computability*, Bonn, January 21, 2007, dvi

**2006**

- Linguistics and Logic of Common Mathematical Language.
*Brouwer Seminar*, Nijmegen, December 12, 2006, pdf - Ordinal Computability and Fine Structure.
*Oberseminar Mathematische Logik*, Bonn, November 9, 2006, pdf - Allgemeingültigkeit und Beweisbarkeit - Zum 100. Geburtstag von Kurt
Gödel.
*Dies Academicus*, Bonn, May 31, 2006, pdf - Ordinal Computability.
*Mathematical Logic Seminar*, Stanford, April 14, 2006, pdf - Proof Checking with a Natural Language Interface.
*Logical Methods in the Humanities Workshop*, Stanford, April 12, 2006, pdf - Ordinals, Computations, and Models of Set Theory (Tutorial),
*Days in Logic*, Coimbra, Portugal, January 19-21, 2006, pdf