Search results

Lavrov I.A. [1979] Retracts of Post’s numbering and effectivization of quantifiers Essays on Math., Phil. Logic, D.Reidel Publ.Com., 287-294 ? article Вернуться к поиску

Lavrov I.A. [1977] Computable numberings Proc. V Inter. Congress Logic, Methodology, Philosophy Sci., (London, Ontario, Canada, 1975), D.Reider Publ. Comp., 195-206 ? E article Вернуться к поиску

Lavrov I.A. [1985] The use of the Theory of algorithms in General Systems Theory A Science of Goal Formulation, Hemisphere Publ. Corp., 1991, 151-160 ? article Вернуться к поиску

Igor Lavrov (1937–2011) Igor Lavrov – the leading research officer of Theoretical Information Department of Institute for System Programming of Russian Academy of Sciences (ISP RAS). He is a specialist in Mathematical Logic and Theory of Algorithms. His main directions of investigations are recursive functions, elementary theories, reducibilities, degrees of unsolvability, recursively enumerable sets, generalizations of complexity and so ...

Lavrov I. A., Maksimova L. L. [2003] Problems in Set Theory, Mathematical Logic and Theory of algorithms Kluwer Academic/Plenum Publishers (Перевод книги Лавров И.А., Максимова Л. Л. “ Задачи по теории множеств,...

General Theory of Computability (bibliography) by Lavrov I.A. Introduction and using rules of Search System By Author Name: English: A - B - C - D - E - F - G - H - I - J - K - L - M - N - O - P - Q - R - S - T - U - V - W - X - Y - Z Русские: А - Б - В - Г - Д - Е -Ж- З - И - К - Л - М - ...

L La Roche P. Lachlan A. H. Lacombe D. Ladner R.E. LaForte G. Lakins T. Lambert W. M. Landweber L.H. Langford G. Läuchli H. Lavrov I.A. Lebeuf R. Leeds S. Leggett A. Leivant D. Lempp S. LeonardJ Leonhardi S.D. Lerman M. LewisA LewisFD LewisHR LewisPM LiAngs LiXiang Lipton R.J. Liu S.C. Loh Chang-wan LongTJ Longo G. Longpre L. Louveau A. Lowenthal F. Lu Hong Lubarsky R.S. Luckham D....

General Theory of Computability (bibliography) by Lavrov I.A. Introduction This database was created to provide specialists in different areas of computability theory a full view on a variety of current research directions in continuously developing field of theory of algorithms. The bibliography includes more ...