Logical Language of Description of Polynomial Computing

Logical Language of Description of Polynomial Computing Full article

Journal

Doklady Mathematics
ISSN: 1064-5624 , E-ISSN: 1531-8362

Output data

Year: 2019, Volume: 99, Number: 2, Pages: 121-124 Pages count : 4 DOI: 10.1134/S1064562419020030

Authors

Goncharov S.S. ¹ , Sviridenko D.I. ¹

Affiliations

1	Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, 630090, Russian Federation

Abstract: The concept of a term and, accordingly, the concept of a formula are extended using new operators. These extensions of the language preserve the expressiveness of Σ-formulas and, at the level of Δ0-formulas and terms, they ensure the polynomiality of algorithms for calculating the value of a term and deciding the truth of a Σ0-formula. © 2019, Pleiades Publishing, Ltd.

Goncharov S.S. , Sviridenko D.I.
Logical Language of Description of Polynomial Computing
Doklady Mathematics. 2019. V.99. N2. P.121-124. DOI: 10.1134/S1064562419020030 WOS Scopus OpenAlex

Web of science:	WOS:000472169400002
Scopus:	2-s2.0-85067678980
OpenAlex:	W2947298579

DB	Citing
Scopus	9
OpenAlex	9
Web of science	6