Plenary Lecture
Prof. Leo Gordeev
University of Tübingen Tübingen, Germany
Title: Proof Theory in Computability
Abstract: We discuss proof theoretic methods together with applications to traditional theory of computability including familiar problems of propositional complexity. We show that modern proof compressing techniques enable to prove the conjecture NP = coNP = PSPACE:
Bio: Lev Gordeev (Lew Gordeew) : Born in Berlin (Germany). Schooling and studying mathematics and logic in USSR and Poland. Got PhD at Munich LMU and obtained habilitation in mathematics and informatics (computer science) at T ̈ubingen University (Germany). Lectured at T ̈ubingen University and (as guest professor) at Ghent University (Belgium) and PUC Rio de Janeiro (Brazil). Currently retired. Researched, solved several problems and published papers in logic, set theory, proof theory, ordinal combinatorics and informatics. Was chosen a founding member of the institute of combinatorics (FTICA). Nowadays the reseach interested primarly focused on the foundations of mathematics and computability.