<?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">trudyniisi</journal-id><journal-title-group><journal-title xml:lang="ru">Труды НИИСИ</journal-title><trans-title-group xml:lang="en"><trans-title>SRISA Proceedings</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2225-7349</issn><issn pub-type="epub">3033-6422</issn><publisher><publisher-name>НИЦ «КУРЧАТОВСКИЙ ИНСТИТУТ» - НИИСИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">trudyniisi-50</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><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICAL MODELING OF AUTONOMOUS AGENTS</subject></subj-group></article-categories><title-group><article-title>Как автономный когнитивный агент может создавать аксиоматическую теорию</article-title><trans-title-group xml:lang="en"><trans-title>How an Autonomous Cognitive Agent Can Create an Axiomatic Theory</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>Red’ko</surname><given-names>V. G.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Москва</p></bio><email xlink:type="simple">vgredko@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">ФГУ ФНЦ НИИСИ РАН<country>Россия</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>16</day><month>10</month><year>2025</year></pub-date><volume>13</volume><issue>1-2</issue><fpage>46</fpage><lpage>51</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Редько В.Г., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Редько В.Г.</copyright-holder><copyright-holder xml:lang="en">Red’ko V.G.</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://www.t-niisi.ru/jour/article/view/50">https://www.t-niisi.ru/jour/article/view/50</self-uri><abstract><p>Может ли компьютерный автономный агент сам «изобрести» аксиоматический метод и применить его в определенной математической теории. В настоящей статье обсуждается этот вопрос. В качестве прототипа возможной аксиоматической теории используются «Начала» Евклида.</p></abstract><trans-abstract xml:lang="en"><p>Can a computer autonomous agent “invent” an axiomatic method by itself and apply it in a certain mathematical theory. This article discusses this issue. Euclid’s “Elements” is used as a prototype for a possible axiomatic theory.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>аксиомы</kwd><kwd>постулаты</kwd><kwd>теоремы</kwd><kwd>аксиоматическая теория</kwd></kwd-group><kwd-group xml:lang="en"><kwd>axioms</kwd><kwd>postulates</kwd><kwd>theorems</kwd><kwd>axiomatic theory</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">Евклид. НА ЧАЛА. Книги I–VI. (Пер. с греческого и комментарии Д.Д. Мордухай-Болтовского при редакционном участии М.Я. Выгодского и И.Н. Веселовского). М.-Л., ОГИЗ, Государственное издательство технико-теоретической литературы, 1948.</mixed-citation><mixed-citation xml:lang="en">Евклид. НА ЧАЛА. Книги I–VI. (Пер. с греческого и комментарии Д.Д. Мордухай-Болтовского при редакционном участии М.Я. Выгодского и И.Н. Веселовского). М.-Л., ОГИЗ, Государственное издательство технико-теоретической литературы, 1948.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">https://24smi.org/celebrity/4943-evklid.html</mixed-citation><mixed-citation xml:lang="en">https://24smi.org/celebrity/4943-evklid.html</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">I. Newton. Philosophiæ Naturalis Principia Mathematica. 1687. И. Ньютон. Математические начала натуральной философии. М., Наука, 1989.</mixed-citation><mixed-citation xml:lang="en">I. Newton. Philosophiæ Naturalis Principia Mathematica. 1687. И. Ньютон. Математические начала натуральной философии. М., Наука, 1989.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">В.Г. Редько. Как автономный компьютерный агент может самостоятельно открывать законы природы. «Интегрированные модели и мягкие вычисления в искусственном интеллекте». Сборник научных трудов XI Международной научно-практической конференции (ИММВ-2022, Коломна, 16-19 мая 2022 г.). В 2-х томах. Т. 2. М., РАИИ, 2022, 108–118.</mixed-citation><mixed-citation xml:lang="en">В.Г. Редько. Как автономный компьютерный агент может самостоятельно открывать законы природы. «Интегрированные модели и мягкие вычисления в искусственном интеллекте». Сборник научных трудов XI Международной научно-практической конференции (ИММВ-2022, Коломна, 16-19 мая 2022 г.). В 2-х томах. Т. 2. М., РАИИ, 2022, 108–118.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Д. Гильберт. Основания геометрии. М.-Л., ОГИЗ, Государственное издательство технико-теоретической литературы, 1948.</mixed-citation><mixed-citation xml:lang="en">Д. Гильберт. Основания геометрии. М.-Л., ОГИЗ, Государственное издательство технико-теоретической литературы, 1948.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">https://wiki5.ru/wiki/Logic_Theorist</mixed-citation><mixed-citation xml:lang="en">https://wiki5.ru/wiki/Logic_Theorist</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">http://shelf1.library.cmu.edu/IMLS/MindModels/logictheorymachine.pdf</mixed-citation><mixed-citation xml:lang="en">http://shelf1.library.cmu.edu/IMLS/MindModels/logictheorymachine.pdf</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">A.N. Whitehead, B. Russell. Principia Mathematica. Cambridge, Cambridge University. Press, 2nd edition. Vol. I (XLVI + 674 p.) 1925; Vol. II (XXXI + 742 p.) 1927; Vol. III (VIII + 491 p.) 1927.</mixed-citation><mixed-citation xml:lang="en">A.N. Whitehead, B. Russell. Principia Mathematica. Cambridge, Cambridge University. Press, 2nd edition. Vol. I (XLVI + 674 p.) 1925; Vol. II (XXXI + 742 p.) 1927; Vol. III (VIII + 491 p.) 1927.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">A. Newell, J.C. Shaw, H.A. Simon. Report on a general problem-solving program. “Proceedings of the International Conference on Information Processing”. Paris, UNESCO, 15-20 June 1959. Published in 1960 by UNESCO (Paris), R. Oldenbourg (München) and Butterworths (London), 256–264. See also: http://bitsavers.informatik.uni-stuttgart.de/pdf/rand/ipl/P-1584_Report_On_A_General_Problem-Solving_Program_Feb59.pdf</mixed-citation><mixed-citation xml:lang="en">A. Newell, J.C. Shaw, H.A. Simon. Report on a general problem-solving program. “Proceedings of the International Conference on Information Processing”. Paris, UNESCO, 15-20 June 1959. Published in 1960 by UNESCO (Paris), R. Oldenbourg (München) and Butterworths (London), 256–264. See also: http://bitsavers.informatik.uni-stuttgart.de/pdf/rand/ipl/P-1584_Report_On_A_General_Problem-Solving_Program_Feb59.pdf</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">A. Newell. Unified Theories of Cognition. Cambridge, Massachusetts, Harvard University Press, 1990.</mixed-citation><mixed-citation xml:lang="en">A. Newell. Unified Theories of Cognition. Cambridge, Massachusetts, Harvard University Press, 1990.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">H. Gelernter, J. Hansen, D. Loveland. Empirical explorations of the geometry theorem proving machine. “Proceedings of the Western Joint Computer Conference”. 1960, Vol. 17, 143–147. Reprinted in “Computers and Thought”. E. Feigenbaum, J. Feldman (Eds.). New York, McGraw-Hill Book Co., 1963, 153–167. See also: https://dl.acm.org/doi/pdf/10.1145/1460361.1460381</mixed-citation><mixed-citation xml:lang="en">H. Gelernter, J. Hansen, D. Loveland. Empirical explorations of the geometry theorem proving machine. “Proceedings of the Western Joint Computer Conference”. 1960, Vol. 17, 143–147. Reprinted in “Computers and Thought”. E. Feigenbaum, J. Feldman (Eds.). New York, McGraw-Hill Book Co., 1963, 153–167. See also: https://dl.acm.org/doi/pdf/10.1145/1460361.1460381</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">H. Gelernter. Realization of a geometry theorem proving machine. “Proceedings of the International Conference Information Processing”, Paris, June 15-20 1959, 273–282. Reprinted in “Computers and Thought”. E. Feigenbaum, J. Feldman (Eds.). New York, McGraw-Hill Book Co., 1963, 134–152.</mixed-citation><mixed-citation xml:lang="en">H. Gelernter. Realization of a geometry theorem proving machine. “Proceedings of the International Conference Information Processing”, Paris, June 15-20 1959, 273–282. Reprinted in “Computers and Thought”. E. Feigenbaum, J. Feldman (Eds.). New York, McGraw-Hill Book Co., 1963, 134–152.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">H.L. Gelernter, N. Rochester. Intelligent behavior in problem-solving machines. “IBM Journal of Research and Development”, Vol. 2 (1958), No 4, 336–345.</mixed-citation><mixed-citation xml:lang="en">H.L. Gelernter, N. Rochester. Intelligent behavior in problem-solving machines. “IBM Journal of Research and Development”, Vol. 2 (1958), No 4, 336–345.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">A. Ferro, G. Gallo. Automated theorem proving in elementary geometry. “Le Matematiche”. Vol. 43 (1988), No 1,2, 195–224. See also: https://lematematiche.dmi.unict.it/index.php/lematematiche/arti-cle/view/713/678</mixed-citation><mixed-citation xml:lang="en">A. Ferro, G. Gallo. Automated theorem proving in elementary geometry. “Le Matematiche”. Vol. 43 (1988), No 1,2, 195–224. See also: https://lematematiche.dmi.unict.it/index.php/lematematiche/arti-cle/view/713/678</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">D.W. Loveland. Automated Theorem Proving: A Logical Basis. “Fundamental Studies in Computer Science”. Vol. 6. Amsterdam, New York, Oxford, North-Holland Publishing Company, 1978.</mixed-citation><mixed-citation xml:lang="en">D.W. Loveland. Automated Theorem Proving: A Logical Basis. “Fundamental Studies in Computer Science”. Vol. 6. Amsterdam, New York, Oxford, North-Holland Publishing Company, 1978.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Сайт журнала “The Journal of Automated Reasoning”: https://www.springer.com/journal/10817</mixed-citation><mixed-citation xml:lang="en">Сайт журнала “The Journal of Automated Reasoning”: https://www.springer.com/journal/10817</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">https://postnauka.ru/faq/26503</mixed-citation><mixed-citation xml:lang="en">https://postnauka.ru/faq/26503</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>
