Logics of quasiary predicates of quantifier-equational level
First-order composition-nominative logics of partial single-valued, total multiple valued and partial multiple-valued quasiary predicates of quantifierequational level are studied. We define basic semantic properties of the introduced logics, particularly the properties of the relations of logical c...
Збережено в:
| Дата: | 2015 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | Українська |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2015
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/104 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | First-order composition-nominative logics of partial single-valued, total multiple valued and partial multiple-valued quasiary predicates of quantifierequational level are studied. We define basic semantic properties of the introduced logics, particularly the properties of the relations of logical consequence for sets of formulas and the Х–Y-valued relations of logical consequence. On this basis we construct sequent calculi for logics of single-valued quasi-ary predicates of quantifier-equational level. |
|---|