Algebras of general non-deterministic predicates

• Опубліковано в: PROBLEMS IN PROGRAMMING
• Дата: 2018
• Випуск: 1
• Сторінки: 5-21
• ISSN: 1727-4907
• Автори та афіліації: M.S. Nikitchenko — Kiev Taras Shevchenko National University; O.S. Shkilniak — Kiev Taras Shevchenko National University; S.S. Shkilniak — Kiev Taras Shevchenko National University
• Автори: Nikitchenko, M.S., Shkilniak, O.S., Shkilniak, S.S.
• Формат: Стаття
• Мова: Українська
• Опубліковано: PROBLEMS IN PROGRAMMING 2018
• Теми: logic; algebra; non-deterministic predicate; logical consequence; UDC 004.42:510.69
• Онлайн доступ: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/227
• Назва журналу: Problems in programming

Logics of general nondeterministic qua-siary predicates, called GND-predicates, are defined and investigated. These logics are program-oriented logical for-malisms that reflect such properties of programs as partiality, nondeterminism, and non-fixed arity. GND-predicates generalize partial predicate...