<?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">matatecs</journal-id><journal-title-group><journal-title xml:lang="ru">Математика и теоретические компьютерные науки</journal-title><trans-title-group xml:lang="en"><trans-title>Mathematics and Theoretical Computer Science</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2949-3919</issn><publisher><publisher-name>Казанский (Приволжский) федеральный университет</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26907/2949-3919.2024.1.74-93</article-id><article-id custom-type="elpub" pub-id-type="custom">matatecs-40</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>СТАТЬИ</subject></subj-group></article-categories><title-group><article-title>О Σ-представлениях аддитивной группы вещественных чисел</article-title><trans-title-group xml:lang="en"><trans-title>On Σ-presentations of the additive group of the real numbers</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Морозов</surname><given-names>А. С.</given-names></name><name name-style="western" xml:lang="en"><surname>Morozov</surname><given-names>A. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Андрей Сергеевич Морозов </p><p>пр. Акад. Коптюга, д. 4, г. Новосибирск, 630090 </p><p>ул. Пирогова, д. 1, г. Новосибирск, 630090 </p></bio><bio xml:lang="en"><p>Andrey Sergeevich Morozov </p><p>4 Acad. Koptyug Avе., Novosibirsk 630090 </p><p>1 Pirogov str., Novosibirsk 630090 </p></bio><email xlink:type="simple">morozov@math.nsc.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Институт математики им. С.Л. Соболева СО РАН ; Новосибирский Государственный Университет<country>Россия</country></aff><aff xml:lang="en">Sobolev Institute of Mathematics ; Novosibirsk State University<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>15</day><month>04</month><year>2024</year></pub-date><volume>2</volume><issue>1</issue><fpage>74</fpage><lpage>93</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Морозов А.С., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Морозов А.С.</copyright-holder><copyright-holder xml:lang="en">Morozov A.S.</copyright-holder><license 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://matatecs.elpub.ru/jour/article/view/40">https://matatecs.elpub.ru/jour/article/view/40</self-uri><abstract><p>Доказано существование 2ω попарно не Σ-вложимых друг в друга (и тем более не Σ-изоморфных) Σ-представлений аддитивной группы вещественных чисел в наследственно конечной надстройке над упорядоченным полем вещественных чисел.</p></abstract><trans-abstract xml:lang="en"><p>We prove the existence of 2ω pairwise non-Σ-embeddable into each other (and henceforth non-Σ-isomorphic) Σ-presentations of the additive group of the real numbers in the hereditarily finite superstructure over the ordered field of the real numbers.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>обобщенная вычислимость</kwd><kwd>допустимое множество</kwd><kwd>наследственно конечная надстройка</kwd><kwd>сигма-представимая структура</kwd><kwd>вычислимая структура</kwd><kwd>конструктивная структура</kwd><kwd>вычислимость над вещественными числами</kwd><kwd>алгоритмическая размерность</kwd><kwd>автоустойчивость</kwd><kwd>число представлений</kwd></kwd-group><kwd-group xml:lang="en"><kwd>generalized computability</kwd><kwd>admissible set</kwd><kwd>hereditarily finite superstructure</kwd><kwd>sigma-representable structure</kwd><kwd>computable structure</kwd><kwd>constructive structure</kwd><kwd>computability over reals</kwd><kwd>algorithmic dimension</kwd><kwd>autostability</kwd><kwd>number of presentations</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">J. Barwise, Admissible sets and structures, Springer-Verlag, Berlin, G¨ottingen, Heidelberg, 1975.</mixed-citation><mixed-citation xml:lang="en">J. Barwise, Admissible sets and structures, Springer-Verlag, Berlin, G¨ottingen, Heidelberg, 1975.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Ю.Л. Ершов, Определимость и вычислимость, Научная книга, Новосибирск, 1996.</mixed-citation><mixed-citation xml:lang="en">Yu.L. Ershov, Definability and computability, Siberian School of Algebra and Logic, Nauchnaya Kniga (NII MIOONGU), Novosibirsk, 1996 [in Russian].</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Yu.L. Ershov, Σ-Definability of algebraic structures, in: Handbook of Recursive Mathematics Volume 1: Recursive Model Theory, 235–260 (1998). DOI: https://doi.org/10.1016/S0049-237X(98)80006-2</mixed-citation><mixed-citation xml:lang="en">Yu.L. Ershov, Σ-Definability of algebraic structures, in: Handbook of Recursive Mathematics Volume 1: Recursive Model Theory, 235–260 (1998). DOI: https://doi.org/10.1016/S0049-237X(98)80006-2</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">V.G. Puzarenko, Yu.L. Ershov, A.I. Stukachev, HF-computability, in: Computability in context. Computation and logic in the real world, 169–242, Imperial College Press, 2011. DOI: 10.1142/9781848162778_0006</mixed-citation><mixed-citation xml:lang="en">V.G. Puzarenko, Yu.L. Ershov, A.I. Stukachev, HF-computability, in: Computability in context. Computation and logic in the real world, 169–242, Imperial College Press, 2011. DOI: 10.1142/9781848162778_0006</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">А.И. Мальцев, О рекурсивных абелевых группах, ДАН СССР 146 (5), 1009–1012 (1961). URL: https://www.mathnet.ru/rus/dan27085</mixed-citation><mixed-citation xml:lang="en">A.I. Mal’tcev, On recursive Abelian groups, Dokl. AN SSSR 146 (5), 1009–1012 (1961) [in Russian]. URL: https://www.mathnet.ru/rus/dan27085</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">С.С. Гончаров, Проблема числа неавтоэквивалентных конструктивизаций, Алгебра и логика 19 (6), 621–639 (1980). URL: https://www.mathnet.ru/rus/al1702</mixed-citation><mixed-citation xml:lang="en">S.S. Goncharov, The problem of the number of nonautoequivalent constructivizations, Algebra Logika 19 (6), 621–639 (1980). 621–639 [in Russian]. URL: https://www.mathnet.ru/rus/al1702</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">А.С. Морозов, О некоторых представлениях поля вещественных чисел, Алгебра и логика 51 (1), 96–128 (2012). URL: https://www.mathnet.ru/rus/al524</mixed-citation><mixed-citation xml:lang="en">A.S. Morozov, Some presentations of the real number field, Algebra Logic 51 (1), 66–88 (2012). DOI: https://doi.org/10.1007/s10469-012-9171-z</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">А.С. Морозов, О Σ–представлениях вещественного порядка, Алгебра и логика 53 (3), 340–371 (2014). URL: https://www.mathnet.ru/rus/al639</mixed-citation><mixed-citation xml:lang="en">A.S. Morozov, Σ-presentations of the ordering on the reals, Algebra Logic 53 (3), 217–237 (2014). DOI: https://doi.org/10.1007/s10469-014-9285-6</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">А.С. Морозов, Непредставимость некоторых структур анализа в наследственно конечных надстройках, Алгебра и логика 56 (6), 691–711 (2017). DOI: https://doi.org/10.17377/alglog.2017.56.604</mixed-citation><mixed-citation xml:lang="en">A.S. Morozov, Nonpresentability of some structures of analysis in hereditarily finite superstructures, Algebra Logic 56 (6), 458–472 (2018). DOI: https://doi.org/10.1007/s10469-018-9468-7</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">А.С. Морозов, Об одном достаточном условии непредставимости структур в наследственно-конечных надстройках, Алгебра и логика 55 (3), 366–379 (2016). DOI: https://doi.org/10.17377/alglog.2016.55.305</mixed-citation><mixed-citation xml:lang="en">A.S. Morozov, A sufficient condition for nonpresentability of structures in hereditarily finite superstructures, Algebra Logic 55 (3), 242–251 (2016). DOI: https://doi.org/10.1007/s10469-016-9392-7</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">A. Tarski, A decision method for elementary algebra and geometry, The Rand Corporation, Santa Monica, 1957.</mixed-citation><mixed-citation xml:lang="en">A. Tarski, A decision method for elementary algebra and geometry, The Rand Corporation, Santa Monica, 1957.</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>
