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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:PROBLEMS IN PROGRAMMING
Datum:2026
Heft:2-3
Сторінки:48-57
ISSN:1727-4907
Автори та афіліації:
  • M.S. Nikitchenko — Kiev Taras Shevchenko National University
  • S.S. Shkilniak — Kiev Taras Shevchenko National University
Ключові слова:semantics, композиційно-номінативна логіка, predicativity, determinologization, derivational relation, predication, ie. determinatives, syntactical construction, semiotic, що найбільш місткі семантично
Hauptverfasser: Nikitchenko, M.S., Shkilniak, S.S.
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
Завантажити файл: Pdf

Institution

Problems in programming
Beschreibung
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
ISSN:1727-4907