Alexandre Alexandrovich Lyaletsky (Jr.)


Alexandre Alexandrovich Lyaletsky (Jr.)

Ph.D. (Candidate of physics and mathematics in speciality “Theoretical foundations of informatics and cybernetics”)

Senior Scientific Researcher of the Chair of Information Systems, Faculty of Cybernetics,
Taras Shevchenko National University of Kyiv

Address:

Faculty of Cybernetics, Taras Shevchenko National University of Kyiv, 4D, Glushkov avenue, 03680 Kyiv, Ukraine

phones: +(38 044) 259 05 11 (office)

fax: +(38 044) 259 04 39

e-mails: foraal@mail.ru, alyaletsky@yahoo.com


See below:

Short Curriculum Vitae

Scientific Interests

Address

Participation in International Projects

Publications

Papers in Proceedings of Conferences and Workshops


SHORT CURRICULUM VITAE:
 

 

Born: Born in Kiev, Ukraine, on 2 Jan 1982
Education: Student an the Taras Shevchenko National University of Kyiv, Faculty of Cybernetics (1999-2005); Post-graduate student at the Taras Shevchenko National University of Kyiv, Faculty o Cybernetics (1999-2005)
PhD thesis: “Continuity of a function in intensional models of the lambda-similar calculi” in speciality “Theoretical foundations of informatics and cybernetics” (defended in 2009)
Employment: Leading engineer at the Information Technology Research Center, Taras Shevchenko National University of Kyiv (2008-2011). Scientific researcher (2011-2014) and senior scientific researcher (2014-now) being simultaneously a part-time lecturer at the Faculty of Cybernetics

 

SCIENTIFIC INTERESTS:
 

 

  • Untyped lambda-calculus (both proof-theoretical and model-theoretical aspects)
  • General topology
  • Special (not necessarily topological) notions of a continuity of a function determined by means of an underlining partial order relation and their applications to the theory lambda
  • First-order classical logic
  • Category theory, general algebra, and group theory
  • Probabilistic and fuzzy logics

 

Address:
 

 

Faculty of Cybernetics, Taras Shevchenko National University of Kyiv, 4D, Glushkov avenue, 03680 Kyiv, Ukraine

phones: +(38 044) 259 05 11 (office)

fax: +(38 044) 259 04 39

e-mails: foraal@mail.ru, alyaletsky@yahoo.com

International grants:
 

 

  1. A student grant for the participation (with a report) in CALCULEMUS Autumn School in Pisa, Italy (2002);
  2. An ASL grant (USA) for the participation (with a short report) in the Internationl workshop WoLLIC’2004, Fontainebleau, France (2004);
  3. A student grant for the participation (with a report) in the Logic Colloquium’2004, Turin, Italy (2004);
  4. A grant in the framework of the Intas-project 05-1000008-8144 “Practical formal verification using automated reasoning” (2006-2009);
  5. A grant for a short-term research visit (1 month on the topic of the thesis) in the University of Paris 12, France (2009, according to the Spring Call 2009 of the Embassy of France for young scientists);

 

Participation in International Projects:
 

 

  1. Intas 2000-447 “Weak Arithmetics” (2001-2004)
  2. Intas 05-1000008-8144 “Practical formal verification using automated reasoning” (2006-2009)
  3. Bilateral French-Ukrainian project “Mathematical Proving in cooperation with a computer” (2007-2008)
  4. Bilateral Romania-Ukrainian project “Romanian-Ukraine Research Project in Mathematical Knowledge Management” (2008-2009)
  5. Bilateral Austria-Ukrainian project “Automated Processing of Mathematical Knowledge in Natural Style” (2009-2010)

 

Selected Papers:
 

 

  1. A.Lyaletsky. On Complete Sequent Extensions of SLD-Resolution. Student Poster Abstracts of the Calculemus Autumn School 2002, FR 6.2 Informatik, Universitat des Saarlandes, 66041 Saarbrucken, Germany, SEKI Report SR-02-06, 2002: 75-79. (in English).
  2. A. Lyaletsky, O.Yaremchuk. On a method for solving finitely parameterized tasks and its program implementation. Proceedings of the X-th International Conference “Knowledge-Dialog-Solution”, Varna, Bulgaria, June 12-26, 2003: 86-92. (in Russian).
  3. A. Lyaletsky. On Some Logical Properties of Intentional Types of Continuity Defined w.r.t. Partially Order Relations. Control Systems and Machines, No. 1, 2004: 4-9. (in English).
  4. A. Lyaletsky, O.Yaremchuk. On Prediction Method Based on the Fuzzy Logic and its Software Implementation. Artificial Intelligence Studies (Proceedings of the 19th International Conference on Artificial Intelligence, Siedlce, Poland, September 21-24, 2004): 43-48. (in English).
  5. A. Lyaletsky. On types of continuity defined by partially ordered sets and their interconnection with usual topological continuity. The Bulletin of Symbolic Logic, No. 2, 2005: 284 (Also in Abstracts of the Logic Colloquium 2004, Torino, Italy, 25-31 July, 2004). (in English).
  6. A.Lyaletski and A.Lyaletsky. Admissible substitutions and Herbrand’s theorems for classical and intuitionistic logics. Collegium Logicum of the Kurt Godel Society (Godel Centenary 2006 – An International Symposium Celebrating the 100th Birthday of Kurt Godel, 27-29 April 2006, Festsaal of the University of Vienna), Springer, Volume IX, 2006: 41-45. (in English).
  7. A.Lyaletsky. On types of convergence of sequences and topological properties of partially ordered sets. Bulletin of Taras Shevchenko National university of Kyiv, Series: Physics and Mathematics: No. 1, 2008: 121-126. (in Ukrainian).
  8. A.Lyaletsky. On types of continuity of a function and their order-theoretical properties. Bulletin of Taras Shevchenko National university of Kyiv, Series: Physics and Mathematics: No. 2, 2008: 98-104. (in Ukrainian).
  9. A. Lyaletsky. Continuity and set-theoretic models of the theory lambda. Proceedings of the International conference “Mal’tsev Meeting”, Novosibirsk, Russia, August 24-28, 2009: 192. (in Russian).
  10. A.Lyaletsky. Continuity of a function in intensional models of lambda-similar calculi. PhD Thesis, Kiev, 2009: 110 pp. (in Ukrainian).
  11. A.Lyaletsky. Order-theoretical characterization of (θ)-continuous functions and their properties. Proceedings of the International Conference “Mal’tsev Meeting”, Novosibirsk, Russia, 11-14 October, 2011: 103. (in Russian).
  12. A.Lyaletsky. On correct method for _nding a solution of a fuzzy task. Mathematical machines and systems, No. 4, 2011: 78-83. (in Russian).
  13. A.Lyaletsky. Cartesian properties of the category of bounded complete vector lattices. Bulletin of Taras Shevchenko National university of Kyiv, Series: Physics and Mathematics: No. 3, 2012: 109-111. (in Ukrainian).
  14. A.Lyaletsky. Cartesian properties of the categories of bounded complete lattice-ordered abelian groups and vector lattices with continuous morphisms. Proceedings of the International Conference “Mal’tsev Meeting”, Novosibirsk, Russia, 12-16 November, 2012: 112. (in Russian).
  15. A.Lyaletsky. New proofs of important theorems of untyped extensional lambda-calculus. Cybernetics and Systems Analysis, Springer-Verlag, 50(4), 2014: 529-537. (in English).
  16. A.Lyaletsky. Fundamental theorems of extensional untyped _-calculus revisited. Proceedings of the Workshop on Foundations of Informatics (FOI-2015), August 24-29, 2015, Chisinau, Republic of Moldova, 2015: 168-179. (in English).

 

Tutorials and books:
 

 

  1. A.Lyaletsky, A.Afonin. A short tutorial on discrete mathematics. Numbers, sets, functions, relations (published by the decision of the Scientific Council of the National University of Kyiv-Mohyla Academy, Faculty of informatics), Artalex-Print, Kiev, 2014: 56 pp. (in Ukrainian)