Logical Language of Description of Polynomial Computing


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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 \(\Sigma \)-formulas and, at the level of \({{\Delta }_{0}}\)-formulas and terms, they ensure the polynomiality of algorithms for calculating the value of a term and deciding the truth of a \({{\Sigma }_{0}}\)-formula.

作者简介

S. Goncharov

Sobolev Institute of Mathematics, Siberian Branch,
Russian Academy of Sciences

编辑信件的主要联系方式.
Email: s.s.goncharov@math.nsc.ru
俄罗斯联邦, Novosibirsk, 630090

D. Sviridenko

Sobolev Institute of Mathematics, Siberian Branch,
Russian Academy of Sciences

编辑信件的主要联系方式.
Email: dsviridenko47@gmail.com
俄罗斯联邦, Novosibirsk, 630090

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2019