Composition-nominative logics of free-quantifier levels
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...
Gespeichert in:
| Datum: | 2018 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | Ukrainian |
| Veröffentlicht: |
PROBLEMS IN PROGRAMMING
2018
|
| Schlagworte: | |
| Online Zugang: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/180 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Institution
Problems in programming| Zusammenfassung: | 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 composition of weak equality, free-quantifier with composition of strong equality. The paper is mainly dedicated to investigation ofNlogics of free-quantifier levels with equality. Languages and semantic models of such logics are described, their semantic properties are studied, in particular the properties of relations of logical consequence.Problems in programming 2016; 2-3: 38-47 |
|---|