Glebsky Yuri Vasilievich (1927 - 08/01/1977) - Soviet mathematician . The author of 0-1 law in mathematical logic: when the power of the universe tends to infinity, the feasibility share of any sentence that does not contain zero-place predicates tends to 0 or 1. From the proof of Yu. V. Glebsky, the algorithmic solvability of asymptotic truth in first-order logic follows. M. I. Liogonky in his dissertation investigated the concept of conditional share of feasibility. V.A. Talanov and V.V. Knyazev extended the (0-1) law to certain classes of infinite formulas and to multivalued logics.
| Yuri Vasilievich Glebsky | |
|---|---|
 | |
| Date of Birth | 1927 |
| Date of death | August 1, 1977 |
| A country |  the USSR |
| Scientific field | mathematics, mathematical logic |
| supervisor | A. G. Sigalov |
| Famous students | V. N. Shevchenko ; A. A. Markov |
Famous Students
Valery Nikolayevich Shevchenko (b. 1940) - Russian mathematician, doctor of physico-mathematical sciences, head of the department MLiVA VMK UNN.
Alexander Alexandrovich Markov (1937-1994) - a recognized specialist in coding theory, the author of the monograph "Introduction to Coding Theory" (Moscow: Nauka, 1982).
Major works
- Glebsky Yu.V. Convergence in area and convergence in functional // Matematicheskii Sbornik. - T. 30 (72), no. 3. - M .: publishing house of the Academy of Sciences, 1952. - S. 529-542.
- Glebsky Yu. V. On the characteristic properties of solutions to regular and quasiregular problems of the calculus of variations // Doklady of the USSR Academy of Sciences. - 1957. - T. 116, No. 6. - S. 910-912.
- Glebsky Yu. V. Coding with the help of finite automata // Doklady of the USSR Academy of Sciences. - 1961. - T. 141, No. 5. - S. 1054-1058.
- Glebsky Yu. V. Implementable sequences in finite automata // Problems of Cybernetics. - M., 1961. - Issue. 5. - S. 279-282.
- Glebsky Yu. V. On the issue of optimization of the work plan // News of higher educational institutions Radiophysics. - 1963. - T. 6, No. 5. - S. 1034-1051.
- Glebsky Yu. V., Shevchenko V.N. On the compilation of an optimal work schedule // Problems of Cybernetics. - M., 1963. - Issue. 10. - S. 275—279.
- Glebsky Yu. V., Shevchenko V.N. On the compilation of an optimal work schedule on n machines // Transactions on the use of electronic computers in the national economy. Gorky: GSU, 1964 .-- S. 31-34.
- Glebsky Yu.V., Dudich A.M., Kogan D.I., Liogonky M.I., Markov Al. A. Algorithms implemented by repeated applications of finite automata // Problems of Cybernetics. - M., 1965. - Issue. 13. - S. 241-243.
- Glebsky Yu. V., Talanov V. A. Some definitions for the description of systems that change in time // Bulletin of higher educational institutions. Radiophysics. - GSU, 1968. - T. 11, No. 11. - S. 1730-1736.
- Glebsky Yu. V., Kogan D.I., Liogonky M.I., Talanov V.A. Volume and fraction of feasibility of formulas of narrow predicate calculus // Cybernetics. - 1969. - No. 2 - S. 17-26.
- Glebsky Yu. V. On a class of word sets // News of Universities Radiophysics. - Publishing House of the GSU, 1970. - T.13, No. 8. - S. 1256-1258.
- Glebsky Yu. V., Kogan D.I. Additively controlled systems and languages: some algorithmic problems // Cybernetics. - 1971. - No. 4 - S. 25-29.
- Glebsky Yu. V., Gordon E.I. Asynchronous automata and logical languages // Automation and Telemechanics. - 1974. - No. 10 - S. 154-159.
- Glebsky Yu. V., Gordon E.I. Asynchronous automata with delays and logical languages // Automation and Telemechanics. - 1974. - No. 12. - S. 143-148.
- Glebsky Yu. V. On the stability of asynchronous automata // Automation and Telemechanics. - 1976. - No. 12. - S.114-119.
Links
- M. I. Liogonky, V. A. Talanov On the law “0 or 1”, discovered by Yu.V. Glebsky, and other results in the study of quantitative characteristics of logical formulas obtained at the Department of Mathematical Logic and Higher Algebra of the UNN // Mathematics in higher education. 2014. No. 12. P.93-102.
- https://web.archive.org/web/20150402104646/http://www.mliva.org/home/history