Relations of logical consequence in composition nominative logics
Semantic properties of composition nominative logics of partial single-valued, total and partial ambiguous predicates of propositional, renominative and quantifier levels are studied. Relations of logical consequence for pairs and sets of formulas, and relations of logical equivalence are investigat...
Збережено в:
| Дата: | 2025 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Ukrainian |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2025
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/844 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | Semantic properties of composition nominative logics of partial single-valued, total and partial ambiguous predicates of propositional, renominative and quantifier levels are studied. Relations of logical consequence for pairs and sets of formulas, and relations of logical equivalence are investigated.Prombles in programming 2010; 1: 15-38 |
|---|