<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="other" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">8624</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject></subject></subj-group></article-categories><title-group><article-title xml:lang="en">The Weak Zero-One Law for the Random Distance Graphs</article-title><trans-title-group xml:lang="ru"><trans-title>Ослабленный закон «нуля или единицы» для случайных дистанционных графов</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Zhukovskii</surname><given-names>M E</given-names></name><name xml:lang="ru"><surname>Жуковский</surname><given-names>Михаил Евгеньевич</given-names></name></name-alternatives><bio xml:lang="en">Кафедра теории вероятностей; Московский государственный университет им. М.В. Ломоносова; Moscow State University</bio><bio xml:lang="ru">Кафедра теории вероятностей; Московский государственный университет им. М.В. Ломоносова</bio><email>sailau.math@mail.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Moscow State University</institution></aff><aff><institution xml:lang="ru">Московский государственный университет им. М.В. Ломоносова</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2010-02-01" publication-format="electronic"><day>01</day><month>02</month><year>2010</year></pub-date><issue>2.1</issue><issue-title xml:lang="en">NO2.1 (2010)</issue-title><issue-title xml:lang="ru">№2.1 (2010)</issue-title><fpage>11</fpage><lpage>25</lpage><history><date date-type="received" iso-8601-date="2016-09-08"><day>08</day><month>09</month><year>2016</year></date></history><permissions><copyright-statement xml:lang="ru">Copyright ©; 2010, Жуковский М.Е.</copyright-statement><copyright-year>2010</copyright-year><copyright-holder xml:lang="ru">Жуковский М.Е.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/8624">https://journals.rudn.ru/miph/article/view/8624</self-uri><abstract xml:lang="en">In this paper, the weak zero-one j-law is deﬁned. The results for the random distance graphs similar to the statements for the zero-one law and random graphs are obtained.</abstract><trans-abstract xml:lang="ru">В этой работе изучается ослабленный j-закон нуля или единицы. Для случайных дистанционных графов получены результаты, схожие с утверждениями, касающимися закона нуля или единицы для случайных графов.</trans-abstract><kwd-group xml:lang="en"><kwd>zero-one law</kwd><kwd>distance graphs</kwd><kwd>Ehrenfeucht game</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>закон нуля или единицы</kwd><kwd>дистанционные графы</kwd><kwd>игра Эренфойхта</kwd></kwd-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Shwentick T. On Winning Ehrenfeucht Games and Monadic NP // Ann. Pure Appl. Logic. - 1996. - Vol. 79, No 1. - Pp. 61-92.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Верещагин Н. К., Шень А. Языки и исчисления. - М.: МЦНМО, 2000.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Ehrenfeucht A. An Application of Games to the Completness Problem for Formalized Theories // Fund. Math. - 1960. - Vol. 49. - Pp. 121-149.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Bollob.as B. Random Graphs. - 2 edition. - Cambridge University Press, 2001.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Алон Н., Спенсер Дж. Вероятностный метод. - М.: БИНОМ. Лаборатория знаний, 2007.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Range of Degree and Realizability of Formulas in the Restricted Predicate Calculus / Ю. В. Глебский, Д. И. Коган, М. И. Легонький, В. А. Таланов // Cybernetics. - 1972. - Vol. 5. - Pp. 142-154.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Fagin R. Probabilities in Finite Models // J. Symbolic Logic. - 1976. - Vol. 41. - Pp. 50-58.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Shelah S., Spencer J. H. Zero-One Laws for Sparse Random Graphs // J.Amer. Math. Soc. - 1988. - Vol. 1. - Pp. 97-115.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Райгородский А. М. Проблема Борсука и хроматические числа метрических пространств // Успехи Матем. Наук. - 2001. - Т. 56, № 1. - С. 107-146.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Райгородский А. М. Линейно-алгебраический метод в комбинаторике. - М.: МЦНМО, 2007.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Холл М. Комбинаторика. - М.: Мир, 1970.</mixed-citation></ref></ref-list></back></article>
