Compositional-nominative logics over hierarchical data
New logics more adequate for property descriptions of functions and predicates over hierarchical data are constructed. A characteristic fea-ture of such logics is use of composite names in their languages. Semantic properties of such logics are investigated, corresponding sequent calculi are defined...
Gespeichert in:
| Datum: | 2026 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | Ukrainisch |
| Veröffentlicht: |
PROBLEMS IN PROGRAMMING
2026
|
| Schlagworte: | |
| Online Zugang: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/864 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Institution
Problems in programming| Zusammenfassung: | New logics more adequate for property descriptions of functions and predicates over hierarchical data are constructed. A characteristic fea-ture of such logics is use of composite names in their languages. Semantic properties of such logics are investigated, corresponding sequent calculi are defined.Problems in programming 2010; 2-3: 48-57 |
|---|