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

Full description

Saved in:

Bibliographic Details
Published in:	Siberian advances in mathematics Vol. 33; no. 1; pp. 66 - 85
Main Author:	Nechesov, A. V.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.02.2023 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!