Lew Gordeev

Possui graduação em Mathematics - Leningrad State University, USSR (1966), graduação em mathematics - Warsaw University, Poland (1973) e doutorado em Matemática - L.-M. University Munich, Germany (1985). Atualmente é docent lecturer at computer science dept. - Universitat Tubingen, Germany. Tem experiência na área de Ciência da Computação, com ênfase em Ciência da Computação

Informações coletadas do Lattes em 04/11/2022

Acadêmico

Formação acadêmica

Doutorado em Matemática

1980 - 1985

Technische Universität München
Título: Proof Theoretical Analysis
Orientador: Weiermann

Graduação em mathematics

1967 - 1968

Wroclaw B. Bierut University

Graduação em Mathematics

1966 - 1966

Leningrad State University

Idiomas

Inglês

Compreende Razoavelmente, Fala Razoavelmente, Lê Bem, Escreve Bem.

Alemão

Compreende Bem, Fala Bem, Lê Bem, Escreve Bem.

Russo

Compreende Bem, Fala Bem, Lê Bem, Escreve Bem.

Polonês

Compreende Bem, Fala Razoavelmente, Lê Bem, Escreve Razoavelmente.

Áreas de atuação

Grande área: Ciências Exatas e da Terra / Área: Ciência da Computação.

Grande área: Ciências Exatas e da Terra / Área: Ciência da Computação / Subárea: Teoria da Computação.

Grande área: Ciências Exatas e da Terra / Área: Ciência da Computação / Subárea: Matemática da Computação.

Grande área: Ciências Exatas e da Terra / Área: Matemática.

Grande área: Ciências Exatas e da Terra / Área: Matemática / Subárea: Análise.

Grande área: Ciências Exatas e da Terra / Área: Matemática / Subárea: Matemática Aplicada.

Participação em eventos

Logic Colloquium 2011.Logic Colloquium 2011. 2011. (Simpósio).

AOFA '10.Phase transitions in Proof Theory. 2010. (Simpósio).

CLE 30 / XV EBL / XIV SLALM. A note on relative consistency. 2008. (Congresso).

CiE 2006.Toward combinatorial proof of P < NP. 2006. (Simpósio).

PTCS 2001.Proof Theory and Post-Turing Analysis. 2001. (Seminário).

RelMiCS 2000.Combinatorial Principles in Finite Variable Logic. 2000. (Oficina).

Days of Logic and Computability '99.Finite methods in 1-order formalisms. 1999. (Simpósio).

RelMiCS 98.Reduction calculi for Post Logics. 1998. (Oficina).

Logic Colloquium 96.Logic Colloquium 1996. 1996. (Simpósio).

CSL '94.Cut free formalzation of logic with finitely many variables. 1994. (Oficina).

Logic Colloquium 94.Cut free formalzation of logic with finitely many variables. 1994. (Simpósio).

AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors.Quasi-ordinals and proof theory. 1991. (Simpósio).

The L.E.J. Brouwer Centenary Symposium.The L.E.J. Brouwer Centenary Symposium. 1981. (Simpósio).

Produções bibliográficas

QUISPE-CRUZ, MARCELA ; HAEUSLER, EDWARD ; GORDEEV, LEW . On Strong Normalization in Proof-Graphs for Propositional Logic. Electronic Notes in Theoretical Computer Science , v. 323, p. 181-196, 2016.
Gordeev, Lev . Proof-theoretic conservations of weak weak intuitionistic constructive set theories. ANNALS OF PURE AND APPLIED LOGIC , v. 164, p. 1274-1292, 2013.
Gordeev, Lev ; Weiermann, Andreas . Phase transitions of iterated Higman-style well-partial-orderings. Archive for Mathematical Logic (Print) , v. 51, p. 127-161, 2012.
GORDEEV, L. ; Pereira, L. C. . Propositional proof compressions and DNF logic. Logic Journal of the IGPL (Print) , v. 19, p. 62-86, 2011.
GORDEEV, L. . A note on da Costa-Doria exotic formalizations . Archive for Mathematical Logic (Print) , v. 49, p. 813-821, 2010.
GORDEEV, L. ; Haeusler, E. H. ; Costa, V. G. . Proof compressions with circuit-structured substitutions. Journal of Mathematical Sciences (New York, N.Y.) , v. 158, p. 645-658, 2009.
Gordeev, L . Proof Theory and Post-Turing Analysis. Lecture Notes in Computer Science , v. 2183, p. 130-152, 2001.
Gordeev, L . Finite methods in 1-order formalisms. Annals of Pure and Applied Logic (Print) , v. 113, p. 121-151, 2001.
Gordeev, L . Variable compactness in 1-order logic. Logic Journal of the IGPL (Print) , v. 7, p. 327-357, 1999.
Gordeev, L . Cut free formalization of logic with finitely many variables. Part I.. Lecture Notes in Computer Science , v. 933, p. 136-150, 1995.
Gordeev, L . A modified sentence unprovable in PA. The Journal of Symbolic Logic , v. 59, p. 1154-1157, 1994.
Gordeev, L . Generalizations of the Kruskal-Friedman theorems. The Journal of Symbolic Logic , v. 55, p. 157-181, 1990.
Gordeev, L. N. . Generalizations of the one-dimensional version of the Kruskal-Friedman theorems. The Journal of Symbolic Logic , v. 54, p. 100-121, 1989.
GORDEEV, L. . Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees. Archive for Mathematical Logic (Print) , v. 29, p. 29-46, 1989.
Gordeev, L . Proof-theoretical analysis: weak systems of functions and classes. Annals of Pure and Applied Logic (Print) , v. 38, p. 1-121, 1988.
GORDEEV, L. . On cut elimination in the presence of perice rule. Archive for Mathematical Logic (Print) , v. 26, p. 147-164, 1987.
Gordeev, L . Constructive models for Set Theory with Extensionality. Studies in Logic and the Foundations of Mathematics , v. 110, p. 123-147, 1982.
Gordeev, L. N. . An approach to the constructivization of Cantor's set theory. Journal of Soviet Mathematics , v. 15, p. 22-28, 1981.
Gordeev, L . A majorizing semantics for hyperarithmetic sentences. Journal of Soviet Mathematics , v. 15, p. 16-21, 1981.
Gordeev, L . Proof systems in Relation Algebra. Relational methods for computer science applications. Vienna, Austria: Physica Verlag Rudolf Liebing KG, 2001, v. , p. 219-237.
Gordeev, L . Reduction calculi for Post Logics. In: Ewa S. Orlowska. (Org.). Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa (Studies in Fuzziness and Soft Computing). Heidelberg: Physica-Verlag, 1999, v. , p. -.
Gordeev, L ; Weiermann, A. . Phase transitions in proof theory. In: 21st International meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2010), 2011, Vienna - Austria. Discrete Mathematics and Theoretical Computer Science (Online), 2010. p. 343-358.
Gordeev, L . Combinatorial Principles in Finite Variable Logic. In: Fifth International Seminar on Relational Methods in Computer Science, 2002, Valcartier. RelMiCS, 2002. v. 1. p. 39-64.
Gordeev, L . Quasi-ordinals and proof theory. In: Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, 1993, Seatle. Graph Structure Theory, 1993. v. 147. p. 485-494.
Gordeev, L . Proof-theoretic conservations of weak weak intuitionistic constructive set theories. 2011. (Apresentação de Trabalho/Conferência ou palestra).
Gordeev, L . Toward combinatiorial proof of P < NP. 2006. (Apresentação de Trabalho/Conferência ou palestra).

Prêmios

1991

Founding Fellow of the Institute of Combinatorics and its Applications (FTICA), Institute of Combinatorics and its Applications.

1978

1st award of Leningrad Math. Society for Young Mathematicians, Leningrad University.

Histórico profissional

Endereço profissional

Eberhard Karls Universität Tübingen. , Wilhelm-Schickard-Institut, SAND 13, SAND, 72076 - Tubingen, - Alemanha, Telefone: (21) 35271500

Experiência profissional

1992 - Atual

Universität Tübingen

Vínculo: Colaborador, Enquadramento Funcional: Docent lecturer at Computer Science Dept., Carga horária: 30

1983 - 1991

Universität Tübingen

Vínculo: Collaborator, Enquadramento Funcional: Assistant Professorship, Carga horária: 30, Regime: Dedicação exclusiva.

2009 - 2009

Ghent University

Vínculo: Collaborator, Enquadramento Funcional: Visiting Professorship, Templeton project, Carga horária: 30

2008 - 2008

Pontifícia Universidade Católica do Rio de Janeiro, PUC-Rio

Vínculo: Collaborator, Enquadramento Funcional: Visiting Professorship, CNPq project, Carga horária: 30

1977 - 1979

Leningrad Shipbuilding Institute

Vínculo: Collaborator, Enquadramento Funcional: Assistant Professorship, Carga horária: 30