REFLEXIVE-TRANSITIVE CLOSURES OF BINARY RELATIONS

  • Дмитрий Борисович Буй Taras Shevchenko Kiev National University
  • Елена Владимировна Шишацкая Taras Shevchenko National University of Kyiv
  • Санмед Фабанми Taras Shevchenko National University of Kyiv
  • Мохаммед Карам Taras Shevchenko National University of Kyiv

Abstract

The paper is devoted to the mathematical foundations of the linearization algorithms – one of the
methods of names conflict resolution that occurs in object-oriented programming languages which support multiple
inheritance. The main object of study is the reflexive-transitive closure of a binary relation. The properties of this
closure are found: the criterion to be partial order, closure is the closure operator, three denotation representations of
closure in terms of its properties and as the least solution of some characteristic equation are established.

Author Biographies

Дмитрий Борисович Буй, Taras Shevchenko Kiev National University

ScD, Professor, Taras Shevchenko National University of Kyiv

Елена Владимировна Шишацкая, Taras Shevchenko National University of Kyiv

Software engineer, Taras Shevchenko National University of Kyiv

Санмед Фабанми, Taras Shevchenko National University of Kyiv

PhD student, Taras Shevchenko National University of Kyiv

Мохаммед Карам, Taras Shevchenko National University of Kyiv

PhD student, Taras Shevchenko National University of Kyiv

Published
2016-05-31
Issue
No. 22(98) (2016): Electrotechnic and Computer Systems
Section
Information Systems and Technologies