See veebileht kasutab küpsiseid kasutaja sessiooni andmete hoidmiseks. Veebilehe kasutamisega nõustute ETISe kasutustingimustega. Loe rohkem
Olen nõus

Sergei Tupailo

https://etis.ee/CV/Sergei_Tupailo/est
22.01.1965
6204167
sergei@cs.ioc.ee

Teenistuskäik

Töökohad ja ametid
01.01.2004–31.12.2005   
The Ohio State University, USA; Dotsent
01.01.2001–31.12.2004   
University of Leeds, UK; Teadur
01.01.1998–31.12.2000   
University of Bern, Switzerland; Assistent
 
 
Haridustee
1993–1998   
Department of Mathematics, Stanford University, USA
1983–1988   
Kiievi Riiklik Ülikool (KRÜ), matemaatikateaduskond, Ukraina
1979–1983   
Füüsika ja Matemaatika Süvaõppega Gümnaasium KRÜ juures, Ukraina
 
 
Teadusorganisatsiooniline ja -administratiivne tegevus
2001−2001   
ETF project nr. 4497
1993−1993   
Grant, Avatud Eesti Fond
1992−1992   
Grant, USA Infoagentuur
1992−1992   
Grant, Avatud Eesti Fond

Kvalifikatsioon

Teaduspreemiad ja tunnustused
1982, Sergei Tupailo, Keskkooli matemaatikaolümpiaadide võitja, Ukraina: 1979--1982 (1. koht, 4 korral), NSVL: 1980 (2. koht), 1981 ja 1982 (3. kohad)
 
 
Teadustöö põhisuunad
ETIS KLASSIFIKAATOR: 4. Loodusteadused ja tehnika; 4.4. Matemaatika; TÄPSUSTUS: matemaatiline loogika ja matemaatika alused, täpsemalt tõestusteooria, hulgateooria, konstruktivism, eksplitsiitne matemaatika, Hilberti epsilon-asenduste meetod, ordinaalne analüüs

Publikatsioonid

Klass
Aasta
Publikatsioon
 
3.1.
2008
Tupailo, Sergei (2008). Monotone inductive definitions and consistency of New Foundations. Proceedings of Logic Colloquium 2005. Ed. Dimitracopoulos, Costas; Newelski, Ludomir; Normann, Dag; Steel, John R. Cambridge: Cambridge University Press, 255−272. (Lecture Notes in Logic; 28). DOI: 10.1017/CBO9780511546464.016.
1.1.
2006
Rathjen, M.; Tupailo, S. (2006). Characterizing the interpretation of set theory in Martin-Löf type theory. Annals of Pure and Applied Logic, 141 (3), 442−471. DOI: 10.1016/j.apal.2005.12.008.
1.1.
2004
Tupailo, S. (2004). On the intuitionistic strength of monotone inductive definitions. Journal of Symbolic Logic, 69 (3), 790−798. DOI: 10.2178/jsl/1096901767.
1.1.
2003
Tupailo, S. (2003). Epsilon-substitution method for {Delta\sb 1\sp 1}-CR: a constructive termination proof. Logic Journal of the IGPL, 11 (3), 367−377. DOI: 10.1093/jigpal/11.3.367.
1.1.
2003
Tupailo, S. (2003). Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe. Annals of Pure and Applied Logic, 120, 165−196.
3.2.
2003
Tupailo, S. (2003). On non-wellfounded constructive set theory: construction of non-wellfounded sets in explicit mathematics. Games, logic, and constructive sets. _EditorsAbbr Mints,G.; Muskens,R. Stanford (Calif.): CSLI, 109−125. (CSLI Lecture Notes; 161).
1.1.
2001
Tupailo, S. (2001). Realization of analysis into explicit mathematics. Journal of Symbolic Logic, 66 (4), 1848−1864.
3.1.
2000
Tupailo, S. (2000). Finitary reductions for local predicativity, I: Recursively regular ordinals. Logic Colloquium '98 : proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic: held in Prague, Czech Republic, August 9-15, 1998. _EditorsAbbr Buss,S.R.; Hájek,P.; Pudlák,P. Natick, Mass.: Association for Symbolic Logic, 465−499. (Lecture Notes in Logic; 13).
3.1.
1999
Mints, G.; Tupailo, S. (1999). Epsilon-substitution method for the ramified language and $\Delta_1^1$-comprehension rule. Logic and foundations of mathematics: Selected Contributed Papers of the 10th International Congress of Logic, Methodology and Philosophy of Science, Florence, August 19-25, 1995. Ed. Cantini,A.; Casari, E.; Minari, P. Dordrecht: Kluwer Academic Publishers, 107−130. (Synthese Library; 280). DOI: 10.1007/978-94-017-2109-7_8.
1.1.
1996
Mints, G.; Tupailo, S.; Buchholz, W. (1996). Epsilon-substitution method for elementary analysis. Archive for Mathematical Logic, 35 (2), 103−130. DOI: 10.1007/s001530050036.
2.3.
1996
Tupailo, S. (1996). Hilbert's epsilon-symbol in predicative subsystems of analysis. (Doktoritöö, Tartu Ülikool). Tartu: Tartu University Press.
1.2.
1995
Mints, G.; Tupailo, S. (1995). Epsilon-substitution method for ramified analysis. Bulletin of Symbolic Logic, 1 (3), 369−370.
3.1.
1994
Tupailo, S. (1994). On a proof-theoretical analysis of $\Sigma\sp 1\sb 1$-${\rm AC}$, $\Sigma\sp 1\sb 1$-${\rm DC}$ and $\Delta \sp 1\sb 1$-${\rm CA}$. Logic Programming and Automated Reasoning: 5th International Conference, LPAR '94 Kiev, Ukraine, July 16-22, 1994 Proceedings. _EditorsAbbr Pfenning,F. Berlin: Springer, 44−53. (Lecture Notes in Artificial Intelligence; 822).
1.2.
1993
Tupailo, S. (1993). Normalization for arithmetical comprehension with restricted occurrences of Hilbert's epsilon-symbol. Proceedings of the Estonian Academy of Sciences. Physics. Mathematics, 42 (4), 289−299.
3.4.
1993
Tupailo, S. (1993). Normalization for ramified analysis with Hilbert's epsilon symbol. Yearbook of Kurt Gödel Society, Vienna. 211−218.
28.08.2018

Sergei Tupailo

https://etis.ee/CV/Sergei_Tupailo/eng
22.01.1965
6204167
sergei@cs.ioc.ee

Career

Institutions and positions
01.01.2004–31.12.2005   
The Ohio State University, USA; Visiting Associate Professor
01.01.2001–31.12.2004   
University of Leeds, UK; Research Fellow
01.01.1998–31.12.2000   
University of Bern, Switzerland; Assistant
 
 
Education
1993–1998   
Department of Mathematics, Stanford University, USA
1983–1988   
Department of Mathematics, Kiev State University, Ukraine
1979–1983   
Specialized physics and mathematics high school, Kiev State University, Ukraine
 
 
R&D related managerial and administrative work
2001−2001   
ETF project Nr. 4497
1993−1993   
Grant, Open Estonia Foundation
1992−1992   
Grant, United States Information Agency
1992−1992   
Grant, Open Estonia Foundation

Qualifications

Honours & awards
1982, Sergei Tupailo, Mathematical Olympiads for high school students, Republic of Ukraine, 1979 -- 1982 (1-st prizes, 4 times), USSR, 1980 (2-nd prize), 1981, 1982 (3-d prizes, 2 times)
 
 
Fields of research
ETIS CLASSIFICATION: 4. Natural Sciences and Engineering; 4.4. Mathematics; SPECIFICATION: Mathematical Logic and Foundations of Mathematics, in particular: proof theory, set theory, constructivism, explicit mathematics, Hilbert's epsilon substitution method, ordinal analysis

Publications

Category
Year
Publication
 
3.1.
2008
Tupailo, Sergei (2008). Monotone inductive definitions and consistency of New Foundations. Proceedings of Logic Colloquium 2005. Ed. Dimitracopoulos, Costas; Newelski, Ludomir; Normann, Dag; Steel, John R. Cambridge: Cambridge University Press, 255−272. (Lecture Notes in Logic; 28). DOI: 10.1017/CBO9780511546464.016.
1.1.
2006
Rathjen, M.; Tupailo, S. (2006). Characterizing the interpretation of set theory in Martin-Löf type theory. Annals of Pure and Applied Logic, 141 (3), 442−471. DOI: 10.1016/j.apal.2005.12.008.
1.1.
2004
Tupailo, S. (2004). On the intuitionistic strength of monotone inductive definitions. Journal of Symbolic Logic, 69 (3), 790−798. DOI: 10.2178/jsl/1096901767.
1.1.
2003
Tupailo, S. (2003). Epsilon-substitution method for {Delta\sb 1\sp 1}-CR: a constructive termination proof. Logic Journal of the IGPL, 11 (3), 367−377. DOI: 10.1093/jigpal/11.3.367.
1.1.
2003
Tupailo, S. (2003). Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe. Annals of Pure and Applied Logic, 120, 165−196.
3.2.
2003
Tupailo, S. (2003). On non-wellfounded constructive set theory: construction of non-wellfounded sets in explicit mathematics. Games, logic, and constructive sets. _EditorsAbbr Mints,G.; Muskens,R. Stanford (Calif.): CSLI, 109−125. (CSLI Lecture Notes; 161).
1.1.
2001
Tupailo, S. (2001). Realization of analysis into explicit mathematics. Journal of Symbolic Logic, 66 (4), 1848−1864.
3.1.
2000
Tupailo, S. (2000). Finitary reductions for local predicativity, I: Recursively regular ordinals. Logic Colloquium '98 : proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic: held in Prague, Czech Republic, August 9-15, 1998. _EditorsAbbr Buss,S.R.; Hájek,P.; Pudlák,P. Natick, Mass.: Association for Symbolic Logic, 465−499. (Lecture Notes in Logic; 13).
3.1.
1999
Mints, G.; Tupailo, S. (1999). Epsilon-substitution method for the ramified language and $\Delta_1^1$-comprehension rule. Logic and foundations of mathematics: Selected Contributed Papers of the 10th International Congress of Logic, Methodology and Philosophy of Science, Florence, August 19-25, 1995. Ed. Cantini,A.; Casari, E.; Minari, P. Dordrecht: Kluwer Academic Publishers, 107−130. (Synthese Library; 280). DOI: 10.1007/978-94-017-2109-7_8.
1.1.
1996
Mints, G.; Tupailo, S.; Buchholz, W. (1996). Epsilon-substitution method for elementary analysis. Archive for Mathematical Logic, 35 (2), 103−130. DOI: 10.1007/s001530050036.
2.3.
1996
Tupailo, S. (1996). Hilbert's epsilon-symbol in predicative subsystems of analysis. (Doktoritöö, Tartu Ülikool). Tartu: Tartu University Press.
1.2.
1995
Mints, G.; Tupailo, S. (1995). Epsilon-substitution method for ramified analysis. Bulletin of Symbolic Logic, 1 (3), 369−370.
3.1.
1994
Tupailo, S. (1994). On a proof-theoretical analysis of $\Sigma\sp 1\sb 1$-${\rm AC}$, $\Sigma\sp 1\sb 1$-${\rm DC}$ and $\Delta \sp 1\sb 1$-${\rm CA}$. Logic Programming and Automated Reasoning: 5th International Conference, LPAR '94 Kiev, Ukraine, July 16-22, 1994 Proceedings. _EditorsAbbr Pfenning,F. Berlin: Springer, 44−53. (Lecture Notes in Artificial Intelligence; 822).
1.2.
1993
Tupailo, S. (1993). Normalization for arithmetical comprehension with restricted occurrences of Hilbert's epsilon-symbol. Proceedings of the Estonian Academy of Sciences. Physics. Mathematics, 42 (4), 289−299.
3.4.
1993
Tupailo, S. (1993). Normalization for ramified analysis with Hilbert's epsilon symbol. Yearbook of Kurt Gödel Society, Vienna. 211−218.
28.08.2018

Otsi projekti

  • {{item.Name}}
Asutus on projekti finantseerija   Asutus on projekti teostaja  
  • {{searchListItem.Name}}
Kõik   Tavaprojektid   Ülemprojektid   Alamprojektid  
Uus Frascati (2015)
Uus ja vana Frascati (otsing uue järgi väljastab ka seotud vanad)
Kõik
Käimasolevad
Lõppenud
Algus
Hajus
Täpne
Lihtotsing Tühjenda
  • Leitud 5 kirjet
ProgrammLiikNumberNimiProjekti algusProjekti lõppVastutav täitjaAsutusFinantseerijapoolne rahastamine
SFSF0322519As03Analüütilised ja numbrilised meetodid modelleerimises01.01.200331.12.2007Jaan JannoTallinna Tehnikaülikool, TTÜ Küberneetika Instituut205 559,03 EUR
ETFETF7134Hulgateooria, automorfismid ja väline forsseerimine01.01.200730.09.2009Sergei TupailoTallinna Tehnikaülikool, TTÜ Küberneetika Instituut11 350,71 EUR
SFSF0140083s08Mittelineaarsed, puuduliku informatsiooni ja keeruka struktuuriga matemaatilised mudelid01.01.200831.12.2013Inga KangroTallinna Tehnikaülikool, TTÜ Küberneetika Instituut513 179,33 EUR
SFSF0321769s01Ontoloogiale orienteeritud programmeerimine01.01.200131.12.2005Jaan PenjamTallinna Tehnikaülikool, TTÜ Küberneetika Instituut492 119,70 EUR
MUUG4497 (ETF4497)Tõestusteooria ühtsusest01.01.200131.12.2001Sergei TupailoTallinna Tehnikaülikool; Tallinna Tehnikaülikool, TTÜ Küberneetika Instituut1 917,35 EUR