Semantic Programming and Polynomially Computable Representations

In the present article, we consider the question on existence of polynomially computable representations for basic syntactic constructions of the first-order logic and for objects of semantic programming (such as -programs and -formulas). We prove that the sets of linear or tree-like derivations in...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Siberian advances in mathematics Jg. 33; H. 1; S. 66 - 85
1. Verfasser:	Nechesov, A. V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.02.2023 Springer Nature B.V
Schlagworte:	Algorithms Calculus Language Mathematics Mathematics and Statistics Polynomials Predicate calculus Programming languages Representations Semantics semantic programming Gandy theorem smart contracts proof verification GNF-systems iterative terms polynomial computability PAG-theorem artificial intelligence proof theory
ISSN:	1055-1344, 1934-8126
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!