Publications

• Journal articles (refereed)
  • Published
  • To appear
• Book contributions (refereed)
• Electronic publications (refereed)
• Edited publications
• Theses
• Reviews
• Abstracts
• Technical Reports
• Lecture Notes

• Journal articles
• Reinhard Kahle. Universes over Frege structures. Annals of Pure and Applied Logic, 119(1-3): 191-223. 2003.

• Reinhard Kahle. Structured Belief Bases. Logic and Logical Philosophy, 10: 45-58. 2002

• Reinhard Kahle. Mathematical proof theory in the light of ordinal analysis. Synthese, 133(1-2): 237-255. 2002.

• Volker Peckhaus and Reinhard Kahle. Hilbert's paradox. Historia Mathematica, 29(2): 157-175. 2002.

• Reinhard Kahle and Thomas Studer. Formalizing non-termination of recursive programs. Journal of Logic and Algebraic Programming, 49(1-2): 1-14. 2001.

• Reinhard Kahle. Truth in applicative theories. Studia Logica, 68(1): 103-128. 2001.

• Gerhard Jäger, Reinhard Kahle, and Thomas Studer. Universes in explicit mathematics. Annals of Pure and Applied Logic, 109(3):141-162, 2001.

• Reinhard Kahle. N-strictness in applicative theories. Archive for Mathematical Logic, 39(2):125-144, 2000.

• Reinhard Kahle. Frege structures for partial applicative theories. Journal of Logic and Computation, 9(5):683-700, 1999.

• Gerhard Jäger, Reinhard Kahle, Anton Setzer, and Thomas Strahm. The proof-theoretic analysis of transfinitely iterated fixed point theories. Journal of Symbolic Logic, 64(1): 53-67. 1999.

• Book contributions (refereed)
• Reinhard Kahle and Thomas Studer. A Theory of Explicit Mathematics Equivalent to ID₁. In P. Clote, H. Schwichtenberg, editors, CSL 2000. Volume 1862 of Lecture Notes in Computer Science. pp. 356-370. Springer, 2000.

• Gerhard Jäger, Reinhard Kahle, and Thomas Strahm. On applicative theories. In A. Cantini, E. Casari, and P. Minari, editors, Logic and Foundations of Mathematics. Volume 280 of Synthese Library. pp. 83-92. Kluwer, 1999.

• Electronic publications (refereed)
• Reinhard Kahle. Proof-theoretic notions for software maintenance. Electronic Notes in Theoretical Computer Science, 40, 2001.

• Edited publications
• Reinhard Kahle, Peter Schroeder-Heister, and Robert Stärk, editors. Proof Theory in Computer Science. Dagstuhl Seminar, volume 2183 of Springer Lecture Notes in Computer Science. Springer, 2001.

• Reinhard Kahle and Peter Schroeder-Heister, editors. Proof-theoretic semantics. 200x. In preparation.

• Reinhard Kahle, editor. Intensionality. 200x. In preparation.

• Theses
• Reinhard Kahle. Applikative Theorien und Frege-Strukturen. Doktorarbeit, Institut für Informatik und angewandte Mathematik, Universität Bern, März 1997.

• Reinhard Kahle. Einbettung des Beweissystems LAMBDA in eine Theorie von Operationen und Klassen. Diplomarbeit, Universität München, Dezember 1992.

• Reviews
• Paolo Mancosu, editor. From Bouwer to Hilbert. The Debate on the Foundations of Mathematics in the 1920s. Oxford University Press, 1998. In Philosophiegeschichte und logische Analyse/Logical Analysis and History of Philosophy, 4:213-219, 2001. (in German)

• Wolfgang Burr and Volker Hartung. A characterization of the Σ₁-definable functions of KPω + (uniform AC). Archive for mathematical logic, 37(3): 199-214, 1998 and Wolfgang Burr. A Diller-Nahm-style functional interpretation of KPω. Archive for mathematical logic, 39(8): 599-604, 2000. In Bulletin of Symbolic Logic. 7(4):532-533, December 2001.

• Vincent Hendricks, Stig Andur Pedersen and Klaus Frovin Jørgensen, editors. Proof Theory. History and Philosophical Significance. Synthese Library, Volume 292. Kluwer, 2000. To appear in: Philosophiegeschichte und logische Analyse/Logical Analysis and History of Philosophy.

• Abstracts
• Reinhard Kahle and Anton Setzer. Extended predicative universes. Bulletin of Symbolic Logic. 8(1):141, March 2002. Abstract for the Logic Colloquium 2001.

• Reinhard Kahle. Name induction in explicit mathematics. Bulletin of Symbolic Logic. 7(1):121, March 2001. Abstract for the Logic Colloquium 2000.

• Reinhard Kahle and Volker Peckhaus. Hilbert's Paradox. Bulletin of Symbolic Logic. 7(1):122, March 2001. Abstract for the Logic Colloquium 2000.

• Reinhard Kahle. A proof-theoretic view of necessity. Bulletin of Symbolic Logic, 6(1):115, March 2000. Abstract for the Logic Colloquium '99.

• Reinhard Kahle. Supervaluation in applicative theories. Bulletin of Symbolic Logic. 5(1):114-115, March 1999. Abstract for the Logic Colloquium '98.

• Reinhard Kahle. Uniform limit in explicit mathematics with universes. Bulletin of Symbolic Logic, 4(1):91-92, March 1998. Abstract for the Logic Colloquium '97.

• Reinhard Kahle. Frege structures over applicative theories. Bulletin of Symbolic Logic, 3(2):264-265, June 1997. Abstract for the Logic Colloquium '96.

• Technical Reports
• Reinhard Kahle. Towards a proof theoretic treatment of necessity. Technical Report Nr. 14, Forschungsberichte der DFG-Forschergruppe "Logik in der Philosophie", Universitäten Konstanz und Tübingen, 1998.

• Reinhard Kahle. Frege structures for partial applicative theories. Technical Report Nr. 12, Forschungsberichte der DFG-Forschergruppe "Logik in der Philosophie", Universitäten Konstanz und Tübingen, 1998. Vorabdruck.

• Reinhard Kahle. N-Strictness in applicative theories. Technical Report Nr. 11, Forschungsberichte der DFG-Forschergruppe "Logik in der Philosophie", Universitäten Konstanz und Tübingen, 1998. Vorabdruck.

• Reinhard Kahle. Uniform limit in explicit mathematics with universes. Technical Report IAM-97-002, IAM, Universität Bern, März 1997.

• Reinhard Kahle. Frege structures for partial applicative theories. Technical Report IAM-96-013, IAM, Universität Bern, September 1996. Vorversion.

• Reinhard Kahle. Universes over Frege Structures. Technical Report IAM-96-010, IAM, Universität Bern, Mai 1996.

• Reinhard Kahle. Natural numbers and forms of weak induction in applicative theories. Technical Report IAM-95-001, IAM, Universität Bern, Januar 1995. Vorversion.

• Lecture Notes
• Reinhard Kahle. Einführung in die Logik. Vorlesungsskript. Humboldt-Studienzentrum, Universität Ulm. Wintersemester 2001/2002.

• Reinhard Kahle. Einführung in die Logikprogrammierung. Vorlesungsskript. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen. Wintersemester 2000/2001.

• Reinhard Kahle. Automatisches Beweisen. Vorlesungsskript. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen. Sommersemester 1998.