[ sulge aken ]

Elulookirjeldus (CV)
1.Eesnimi Sergei
2.Perekonnanimi Tupailo
3.Töökoht TTÜ Küberneetika Instituut
4.Ametikoht vanemteadur
5.Sünniaeg 22.01.1965 (päev.kuu.aasta)
6.Haridus kõrgem
7.Teenistuskäik 1986-1988 assistent, Kiev University, Ukraina
1988-1989 assistent, Poltava Engineering Institute, Ukraina
1990-1993 teadur, Küberneetika Instituut, Eesti
1993-1998 assistent, Department of Mathematics, Stanford University, USA
1998-2000 assistent, Institute for Informatics and Appliedd Mathematics, University of Bern, Sveits
alates 11.2000 vanemteadur, TTÜ Küberneetika Instituut, Eesti
8.Teaduskraad PhD
9.Teaduskraadi välja
andnud asutus, aasta
Tartu Ülikool, 1996
Stanfordi Ülikool, USA, 1998
10.Tunnustused
11.Teadusorganisatsiooniline
ja –administratiivne
tegevus
12.Juhendamisel kaitstud
väitekirjad
13.Teadustöö põhisuunad Matemaatiline loogika
14.Jooksvad grandid
15.Teaduspublikatsioonid

S. Tupailo, Monotone Inductive Definitions and consistency of New Foundations. Proceedings of Logic Colloquium 2005, North Holland, to appear.

S. Tupailo, M. Rathjen, Characterizing the interpretation of set theory in Martin-Löf type theory. Annals of Pure and Applied Logic, to appear.

S. Tupailo. On the Intuitionistic Strength of Monotone Inductive Definitions. Journal of Symbolic Logic: 69(3), 790-798, 2004

S. Tupailo. Epsilon Substitution Method for $\Delta^1_1-CR$: a Constructive Termination Proof. Logic Journal of the IGPL, Vol. 11 No. 3, pp. 365-375, 2003

S. Tupailo. On Non-wellfounded Constructive Set Theory. In: G. Mints, R. Muskens (eds.), Games, Logic, and Constructive Sets, 109-125, CSLI Publications, 2003

S. Tupailo, Realization of Constructive Set Theory into Explicit Mathematics: a lower bound for impredicative Mahlo universe. Annals of Pure and Applied Logic: 120/1-3, pp. 165-196, 2003

S. Tupailo, Realization of analysis into Explicit Mathematics, Journal of Symbolic Logic: 66(4), 1848-1864, 2001

S. Tupailo, Finitary reductions for local predicativity, 1: recursively regular ordinals. In: S. Buss, P. Hajek, P. Pudlak (eds.), Logic Colloquium 98, A. K. Peters, Ltd, 465-499, 2000

S. Tupailo, G. Mints, Epsilon-substitution method for the ramified language and $\Delta^1_1$-comprehension rule. In: A. Cantini, E. Casari, P.L. Minari (eds.), Logic and Foundations of Mathematics, Kluwer, 107-130, 1999

viimati muudetud: 07.10.2005

Curriculum Vitae (CV)
1.First Name Sergei
2.Surname Tupailo
3.Institution Institute of Cybernetics at TUT
4.Position senior researcher
5.Date of birth 22.01.1965 (day.month.year)
6.Education high education
7.Research and
professional experience
1986-1988 Research assistant (mathematical statistics), Kiev University, Ukraine
1988-1989 Teaching assistant (mathematics), Poltava Engineering Institute, Ukraine
1990-1993 Researcher (mathematical logic), Institute of Cybernetics of Estonian Academy of Sciences, Tallinn, Estonia
1993-1998 Student course assistant (mathematics), Department of Mathematics, Stanford University, USA
1998-2000 Assistant, Institute for Informatics and Appliedd Mathematics, University of Bern, Switzerland
since 11.2000 Senior researcher, Institute of Cybernetics at Tallinn Technical University, Estonia
8.Academic degree PhD
9.Dates and sites of
earning the degrees
University of Tartu, 1996
Stanford University, USA, 1998
10.Honours/awards
11.Research-administrative
experience
12.Supervised dissertations
13.Current research program Mathematical logic
14.Current grant funding
15.List of most important publications

S. Tupailo, Monotone Inductive Definitions and consistency of New Foundations. Proceedings of Logic Colloquium 2005, North Holland, to appear.

S. Tupailo, M. Rathjen, Characterizing the interpretation of set theory in Martin-Löf type theory. Annals of Pure and Applied Logic, to appear.

S. Tupailo. On the Intuitionistic Strength of Monotone Inductive Definitions. Journal of Symbolic Logic: 69(3), 790-798, 2004

S. Tupailo. Epsilon Substitution Method for $\Delta^1_1-CR$: a Constructive Termination Proof. Logic Journal of the IGPL, Vol. 11 No. 3, pp. 365-375, 2003

S. Tupailo. On Non-wellfounded Constructive Set Theory. In: G. Mints, R. Muskens (eds.), Games, Logic, and Constructive Sets, 109-125, CSLI Publications, 2003

S. Tupailo, Realization of Constructive Set Theory into Explicit Mathematics: a lower bound for impredicative Mahlo universe. Annals of Pure and Applied Logic: 120/1-3, pp. 165-196, 2003

S. Tupailo, Realization of analysis into Explicit Mathematics, Journal of Symbolic Logic: 66(4), 1848-1864, 2001

S. Tupailo, Finitary reductions for local predicativity, 1: recursively regular ordinals. In: S. Buss, P. Hajek, P. Pudlak (eds.), Logic Colloquium 98, A. K. Peters, Ltd, 465-499, 2000

S. Tupailo, G. Mints, Epsilon-substitution method for the ramified language and $\Delta^1_1$-comprehension rule. In: A. Cantini, E. Casari, P.L. Minari (eds.), Logic and Foundations of Mathematics, Kluwer, 107-130, 1999

last updated: 07.10.2005

[ sulge aken ]