Composition-nominative logics of free-quantifier levels

• Опубліковано в: PROBLEMS IN PROGRAMMING
• Дата: 2018
• Випуск: 2-3
• Сторінки: 38-47
• ISSN: 1727-4907
• Автори та афіліації: S.S. Shkilniak — Kiev Taras Shevchenko National University; D.B. Volkovytskyi — Kiev Taras Shevchenko National University
• Автори: Shkilniak, S.S., Volkovytskyi, D.B.
• Формат: Стаття
• Мова: Українська
• Опубліковано: PROBLEMS IN PROGRAMMING 2018
• Теми: free-quantifier logic; predicate; renomination; superposition; equality; logical consequence; UDC 004.42:510.69
• Онлайн доступ: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/180
• Назва журналу: Problems in programming

Free-quantifier composition nominative logics of partial quasiary predicates are considered. We specify the following levels of these logics: renominative, renominative with predicates of weak equality, renominative with predicates of strong equality, free-quantifier, free-quantifier with compositio...