Logical Language of Description of Polynomial Computing
- 作者: Goncharov S.S.1, Sviridenko D.I.1
-
隶属关系:
- Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences
- 期: 卷 99, 编号 2 (2019)
- 页面: 121-124
- 栏目: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225637
- DOI: https://doi.org/10.1134/S1064562419020030
- ID: 225637
如何引用文章
详细
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
补充文件
