Research interests of Helmut Schwichtenberg
Within Mathematical Logic my interests are in proof theory, lambda calculus
and recursion theory.
In particular I am interested in theoretical and practical studies
concerning program extraction from proofs. A tool suitable for this
task is the
Minlog system
under development at the logic group of LMU. It is an interactive
proof assistant, designed to help constructing proofs (in minimal logic)
on computable functionals and inductively defined predicates.
More generally I am interested in applications of logic in computer
science.
Slides:
-
Simultaneous inductive/coinductive definition of continuous functions,
(Nijmegen 2009)
-
Computable functionals over non-flat data types,
(Kyoto 2009)
-
Proofs and computations,
(Kyoto 2009)
-
Extracting computational content from proofs,
(Tokyo 2009)
-
Program extraction in constructive analysis,
(Tsukuba 2009)
-
Program development by proof transformation,
(Osaka 2009)
-
Decorating proofs,
(Leeds 2009)
-
Logic of inductive definitions with formal neighbourhoods,
(Oslo 2008)
-
Computational content of proofs,
(Münster 2008)
-
Kurt Gödel und die Grundlagen der Mathematik,
(LMU 2007)
-
Proofs with Feasible Computational Content,
(Marktoberdorf 2007)
-
Gödel's Dialectica Interpretation,
(Leiden 2007)
-
Constructive analysis,
(Genua 2006)
-
Inverting monotone continuous functions in constructive analysis,
(Swansea 2006)
Last change: 2011-02-28
Helmut Schwichtenberg,
schwicht [at] math [dot] lmu [dot] de
