Enviar artigo por via de e-mail Logical Language of Description of Polynomial Computing
- Autores: Goncharov S.S.1, Sviridenko D.I.1
-
Afiliações:
- Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences
- Edição: Volume 99, Nº 2 (2019)
- Páginas: 121-124
- Seção: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225637
- DOI: https://doi.org/10.1134/S1064562419020030
- ID: 225637
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
S. Goncharov
Sobolev Institute of Mathematics, Siberian Branch,Russian Academy of Sciences
Autor responsável pela correspondência
Email: s.s.goncharov@math.nsc.ru
Rússia, Novosibirsk, 630090
D. Sviridenko
Sobolev Institute of Mathematics, Siberian Branch,Russian Academy of Sciences
Autor responsável pela correspondência
Email: dsviridenko47@gmail.com
Rússia, Novosibirsk, 630090
Arquivos suplementares
