<< Back to People & Contacts Go to Logic in Informatics Home Page

Alexandre Alexandrovich Lyaletsky (Jr.)




Alexandre Alexandrovich Lyaletsky (Jr.)
Bachelor of Informatics, MSc student
Chair of Programming Theory and Soft Engineering
Faculty of Cybernetics
Kiev National Taras Shevchenko University

See below:
Short Curriculum Vitae
Scientific Interests
Address
Participation in International Projects
Publications
Papers in Proceedings of Conferences and Workshops

SHORT CURRICULUM VITAE:

Title:Bachelor of Informatics

Full-time student:1998 - 2003: Chair of Programming Theory and Soft Engineering, Faculty of Cybernetics, Kiev National Taras Shevchenko University

Master student:2003 - by now: Faculty of Cybernetics, Kiev National Taras Shevchenko University


SCIENTIFIC INTERESTS:

  • Algebra (Group Theory & Lattice Theory)
  • Automated Reasoning
  • Mathematical and Applied Logics
  • Model Theory
  • Topology & Topological Algebra

Address:

Faculty of Cybernetics,
Kiev National Taras Shevchenko University,
2, Glushkov avenue, building 6,
03022 Kiev, Ukraine

phones: +(38 044) 259 05 19 (office)
fax: +(38 044) 259 04 39

e-mails: aal@unicyb.kiev.ua, foraal@mail.ru

Participation in International Projects:

  1. A Member of the Intas 2000-447 “Weak Arithmetics” (2001-2004)

Journal Papers:

  • Alexandre Lyaletsky. On types of continuity defined by partially ordered sets and their interconnection with usual topological continuity. In: The Bulletin of Symbolic Logic, Volume 11, Number 2, 2005.
  • Lyaletsky Alexandre. On Some Logical Properties of Intentional Types of Continuity Defined with Respect to Partially Order Relations. In: Control Systems and Machine, ¹ 1, pages 4-9, 2004.
  • Derevyanchenko A.V. and Lyaletsky A.A. On the Computation Concurrency Problem (in Russian). In: Mathematical Machines and Systems, No. 2, pages, 3-14, 2004.
  • Aselderov Z.M and Lyaletsky A.A., The Contrary-closing Rule and Complete Extensions of Logical Technique of Intellectual Systems with the Input Resolution Rule. In: Mathematical Machines and Systems, No. 2, pages 29-34, 2003.

PAPERS IN PROCEEDINGS OF CONFERENCES AND WORKSHOPS:

  • Lyaletsky Alexandre. Interconnection of the Theories of Partially Ordered Systems and of Topological Algebraic Systems (in Russian). In: Abstract of the International Conference "Algebra, Logic and Cybernetics" (ALC-2004), in honour of the 75-th anniversary of the birth of A.I. Kokorin Irkutsk, Russia, page 66, August 25-28, 2004.
  • Lyaletsky Alexandre and Yaremchuk Aleksadr. On Prediction Method Based on the Fuzzy Logic and its Software Implementation. In: Artificial Intelligence Studies (Proceedings of the 19th International Conference on Artificial Intelligence (AI'19), Siedlce, Poland, September 21-24, 2004),University of Podlasie Publishers, 2004.
  • Alexandre Lyaletsky. On Types of Continuity Defined by Partially Ordered Sets with Usual Topological Continuity. In: TIMETABLE and ABSTRACTS of the Logic Colloquium 2004, Torino, Italy, page 135, July 25-31, 2004.
  • Lyaletsky Alexandre (Jr.). On the notion of Efficiency of Formal Systems from the Point of View of Inference Search Problems. In: Abstracts of Second St.Petersburg Days of Logic and Computability (dedicated to the centennial of Andrey Andreevich Markov), St-Petersburg, Russia, August 24 - 26, pages 144-145, 2003.
  • Lyaletsky Alexandre. On notions of continuity and embeddings of theories of topological algebras intj the theories of partially ordered algebras. In: Abstracts of the 4th International Algebraic Conference in Ukraine, Lviv, August 4-9, pages 139-140, 2003.
  • Lyaletsky A.A. and Yaremchuk A.N. On a Method of Finding Solutions of Finite Parameterized Tasks and its Program Implementation (In Russian). In: Proceedings of the X-th International Conference "Knowledge-Dialog-Solution", Varna, Bulgaria, Foi-Commerce, Sofia, pages 86-92, June 12-26, 2003.
  • Lyaletsky A.A. and Yaremchuk A.N. A Program for Constructing Solutions of Tasks with Fuzzy Data Given as Functions (In Ukrainian). In: Abstracts of the Six Ukrainian (the First International) Student Conference on Applied Mathematics and Informatics. Lviv, pages 121-122 , April 17-18, 2003.
  • Lyaletsky A.A. On Complete Sequent Extensions of SLD-Resolution. In: Student Poster Abstracts of the Calculemus Autumn School 2002: J. Zimmer and Ch. Benzmuller (Eds). FR 6.2 Informatik, Universitat des Saarlandes, 66041 Saarbrucken, Germany. SEKI Report SR-02-06. pages 75-79, 2002.


<< Back to People & Contacts Go to Logic in Informatics Home Page