Thesis/Theses examined by Schwichtenberg, Helmut

Wiesnet, Franziskus (2021): The computational content of abstract algebra and analysis. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics

Petrakis, Iosif (2015): Constructive topology of bishop spaces. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics

Miyamoto, Kenji (2013): Program extraction from coinductive proofs and its application to exact real arithmetic. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics

Karadais, Basil A. (2013): Towards an arithmetic for partial computable functionals. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics

Trifonov, Trifon (2012): Analysis of methods for extraction of programs from non-constructive proofs. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics

Ratiu, Diana (2011): Refinement of Classical Proofs for Program Extraction. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics

Schimanski, Stefan (2009): Polynomial Time Calculi. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics

Kuebler, Martin (2005): Zwei Gedanken zur hoeherstufigen Unifikation: Relevanteste Unifikatoren und Unifikation mit Fallunterscheidung. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics

Miranda Perea, Favio Ezequiel (2004): On Extensions of AF2 with Monotone and Clausular (Co)inductive Definitions. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics