Logics of general non-deterministic predicates: semantic aspects
Semantic aspects of a new class of program-oriented logical formalisms – logics of general non-deterministic quasiary predicates (GND-predicates) – are considered. Сlasses of GND-predicates are singled out, their compositions and algebras are investigated. The language of pure first-order logics of...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
Інститут програмних систем НАН України
2018
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/263 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
Institution
Problems in programming| Summary: | Semantic aspects of a new class of program-oriented logical formalisms – logics of general non-deterministic quasiary predicates (GND-predicates) – are considered. Сlasses of GND-predicates are singled out, their compositions and algebras are investigated. The language of pure first-order logics of GND-predicates is described. The relation of the logical consequence for the sets of formulas is proposed and investigated. The properties of the decomposition of formulas and of quantifier elimination are described.Problems in programming 2018; 2-3: 031-045 |
|---|