[en] Congratulations on our professional holiday—World Logic Day—to colleagues and everyone involved! And we wish you professional achievements! Further, we remind you that this year the celebration of the World Logic Day in Ukraine takes place online as part of the MFOI conference (for links, see the conference program).
We also would like to remind you that numerous events are being held at the international level to commemorate the 3rd World Logic Day (see here), in particular, at 17:00-17:20 (Kyiv time) there will be a live broadcast of the International Welcome Ceremony of the World Logic Day on YouTube.
We encourage colleagues to join the celebration!
[uk] Поздоровляємо колег та усіх причетних з нашим професійним святом — Всесвітнім днем логіки — і бажаємо професійних звершень! Нагадуємо, що цього року відзначення Дня логіки в Україні відбувається онлайн в рамках конференції MFOI (посилання для приєднання див. у програмі конференції).
Також нагадуємо, що на міжнародному рівні проводяться численні заходи з відзначення вже 3-го Всесвітнього дня логіки (див. тут), зокрема, в 17:00-17:20 за Києвом відбудеться пряма трансляція урочистої церемонії з цього приводу на платформі YouTube.
Закликаємо колег долучатися до відзначення!
Four papers were submitted for the Prize:
Ukrainian Logic Society formed a Jury of the logic contest consisting of:
On the 3rd World Logic Day the Chairman of the Jury Prof. Anatoliy Petravchuk announced the results of The Ukrainian Logic Society Contest for young scientists:
The Winner was declared Dr. Ievgen_Ivanov for the paper “On Induction Principles for Partial Orders”.
Our congratulations to Dr. Ievgen Ivanov!
The Winner presented his paper during celebration of the 3rd World Logic Day at the VI International Conference on Mathematical Foundations of Informatics MFOI-2020.
Inductive proofs are widely used in mathematics and computer science. Ordinary induction by a natural number parameter and its generalizations have applications in different domains and frequently appear in formal (computer assisted) mathematics and in formal methods which deal with modeling of the behavior of hardware and software systems and verification of such systems. Formalizations of mathematical results, algorithms, and systems in such computer proof assistant as Isabelle and Coq frequently use induction principles. Induction by a parameter which takes discrete values is the most widely known. However, in the literature one can find principles of induction over a continuous (or not necessarily discrete) parameter, which have a certain analogy with an ordinary mathematical induction, and which are usually called real or continuous induction. The topic of this work is investigation of generalizations of such principles to partially ordered sets, i. e. we study the construction of inductive proofs by a parameter which takes values in a partially ordered set, without assuming that these values are in a certain sense discrete. |
Nationality: | Ukrainian |
Academic Record | |
Dates: | 2010 – 2014 |
Name of institutions: | Taras Shevchenko National University of Kyiv and Paul Sabatier University, Toulouse |
Qualification: | PhD degree in informatics (“Investigation of abstract systems with inputs and outputs as partial functions of time”) |
Dates: | 2008 – 2010 |
Name of institution: | Taras Shevchenko National University of Kyiv |
Qualification: | Master’s degree with honors, informatics |
Dates: | 2004 – 2008 |
Name of institution: | Taras Shevchenko National University of Kyiv |
Qualification: | Bachelor’s degree with honors, applied mathematics |
Scopus publications: 23
Scopus h-index: 6
2019 – present: Taras Shevchenko National University of Kyiv, Faculty of Information Technology, Docent
2014 – 2019: Taras Shevchenko National University of Kyiv, Faculty of Information Technology, Assistant
Scientific interests: Systems theory; formal methods; program logics