<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2020-3-304-315</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1350</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Theory of Computing</subject></subj-group></article-categories><title-group><article-title>О проблеме существования конечных базисов тождеств в алгебрах рекурсивных функций</article-title><trans-title-group xml:lang="en"><trans-title>On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-1427-4937</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Соколов</surname><given-names>Валерий Анатольевич</given-names></name><name name-style="western" xml:lang="en"><surname>Sokolov</surname><given-names>Valery A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Доктор физико-математических наук, профессор, кафедра теоретической информатики, Центр интегрируемых систем.</p><p>Ул. Советская, 14, Ярославль, 150003</p></bio><bio xml:lang="en"><p>Valery Anatolyevich Sokolov - Doctor of Science, Professor, Department of Theoretical Informatics, Centre of Integrable Systems.</p><p>14 Sovetskaya, Yaroslavl 150003</p></bio><email xlink:type="simple">valery-sokolov@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ярославский государственный университет им. П.Г. Демидова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>P.G. Demidov State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>20</day><month>09</month><year>2020</year></pub-date><volume>27</volume><issue>3</issue><fpage>304</fpage><lpage>315</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Соколов В.А., 2020</copyright-statement><copyright-year>2020</copyright-year><copyright-holder xml:lang="ru">Соколов В.А.</copyright-holder><copyright-holder xml:lang="en">Sokolov V.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/1350">https://www.mais-journal.ru/jour/article/view/1350</self-uri><abstract><p>Рафаэль Робинсон показал, что все примитивно рекурсивные функции, зависящие от одного аргумента, и только они могут быть получены из двух функций s(x) = х +1 и q(x) = x - [√x]²</p><p>с помощью операций сложения +, суперпозиции ∗ и итерации i. Джулия Робинсон доказала, что из этих же двух функций с помощью операций сложения +, суперпозиции ∗ и операции ¯¹ обращения функций можно получить все общерекурсивные (при определённом условии на операцию обращения) и все частично рекурсивные функции. На основании этих результатов А. И. Мальцев ввёл в рассмотрение алгебру Рафаэля Робинсона всех одноместных примитивно рекурсивных функций и две алгебры Джулии Робинсон: частичную алгебру всех одноместных общерекурсивных функций и алгебру всех одноместных частично рекурсивных функций, и предложил исследовать свойства этих алгебр, в том числе, выяснить, существуют ли в этих алгебрах конечные базисы тождеств. В этой статье мы показываем, что конечного базиса тождеств ни в одной из указанных алгебр не существует.</p></abstract><trans-abstract xml:lang="en"><p>Raphael Robinson showed that all primitive recursive functions depending on one argument, and only they could be obtained from two functions s(x) = x +1 and q(x) = x - [√x]² by using operations of addition +, superposition ∗ and iteration i. Julia Robinson proved that from the same two functions, using the addition +, superposition ∗ and operation ¯¹ of function inversion, one could obtain all general recursive functions (under a certain condition on the inversion operation) and all partially recursive functions. On the basis of these results, A. I. Maltsev brought into consideration the Raphael Robinson algebra of all unary primitive recursive functions and two Julia Robinson algebras: the partial algebra of all unary general recursive functions and the algebra of all unary partially recursive functions and proposed to study the properties of these algebras, including the question of the existence of finite bases of identities in these algebras. In this article we show that there is no finite basis of identities in any of the indicated algebras.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>алгебры</kwd><kwd>рекурсивные функции</kwd><kwd>тождества</kwd><kwd>базис</kwd><kwd>суперпозиция</kwd><kwd>итерация</kwd><kwd>обращение функции</kwd></kwd-group><kwd-group xml:lang="en"><kwd>algebras</kwd><kwd>recursive functions</kwd><kwd>identities</kwd><kwd>basis</kwd><kwd>superposition</kwd><kwd>iteration</kwd><kwd>function inversion</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Инициативная НИР ВИП-004 (номер госрегистрации АААА-А16-116070610022-6)</funding-statement><funding-statement xml:lang="en">The initiative program VIP-004 (state registration number AAAA-A16-116070610022-6)</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">A. I. Mal’tsev, "Constructive algebras I”, Russian Mathematical Surveys, vol. 16, no. 3, pp. 77-129,1961.</mixed-citation><mixed-citation xml:lang="en">A. I. Mal’tsev, "Constructive algebras I”, Russian Mathematical Surveys, vol. 16, no. 3, pp. 77-129,1961.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">A. I. Mal’tsev, Algoritmy i rekursivnye funktsii. Moscow: Nauka, 1965, In Russian.</mixed-citation><mixed-citation xml:lang="en">A. I. Mal’tsev, Algoritmy i rekursivnye funktsii. Moscow: Nauka, 1965, In Russian.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">J. Robinson, "Primitive recursive functions”, Proceedings of the American Mathematical Society, vol. 1, no. 6, pp. 703-718, 1950.</mixed-citation><mixed-citation xml:lang="en">J. Robinson, "Primitive recursive functions”, Proceedings of the American Mathematical Society, vol. 1, no. 6, pp. 703-718, 1950.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">R. M. Robinson, "Primitive recursive functions”, Bulletin of the American Mathematical Society, vol. 53, no. 10, pp. 925-942, 1947.</mixed-citation><mixed-citation xml:lang="en">R. M. Robinson, "Primitive recursive functions”, Bulletin of the American Mathematical Society, vol. 53, no. 10, pp. 925-942, 1947.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">V. A. Sokolov, "Ob odnom klasse tozhdestv v algebre Robinsona”, in 14-ya Vsesoyuznaya algebraicheskaya konferentsiya: tezisy dokladov, In Russian, vol. 2, Novosibirsk, 1977, pp. 123-124.</mixed-citation><mixed-citation xml:lang="en">V. A. Sokolov, "Ob odnom klasse tozhdestv v algebre Robinsona”, in 14-ya Vsesoyuznaya algebraicheskaya konferentsiya: tezisy dokladov, In Russian, vol. 2, Novosibirsk, 1977, pp. 123-124.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">P. M. Cohn, Universal Algebra. New York, Evanston, and London: Harper &amp; Row, 1965.</mixed-citation><mixed-citation xml:lang="en">P. M. Cohn, Universal Algebra. New York, Evanston, and London: Harper &amp; Row, 1965.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">A. Robinson, "Equational logic for partial functions under Kleene equality: a complete and an incomplete set of rules”, The Journal of Symbolic Logic, vol. 54, no. 2, pp. 354-362, 1989.</mixed-citation><mixed-citation xml:lang="en">A. Robinson, "Equational logic for partial functions under Kleene equality: a complete and an incomplete set of rules”, The Journal of Symbolic Logic, vol. 54, no. 2, pp. 354-362, 1989.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
