Search results
News
General Theory of Computability
(bibliography)
by Lavrov I.A.
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
Русские: А-Б-В-Г-Д-Е-Ж-З-И-К-Л-М-Н-О-П-Р-С-Т-У-Ф-Х-Ц-Ч-Ш-Щ-Э-Ю-Я
Search
Janiczak A. [1950] A remark concerning decidability of complete theories J. Symbolic Logic, 15, № 4, 277-279 ~ O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Janiczak A. [1954] On the reducibility of decision problem Colloq. Math., 3, № 1, 33-36 56.116 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Janiczak A. [1953] Undecidability of some simple formalized theories Fund. Math., 40, 131-139 54.4321 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Janiczak A. [1954] Some remarks on partially recursive functions Colloq. Math., 3, № 1, 37-38 55.582 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.J Jacobs B. E. Jacobs K. Jahn M.A. Jain S. Janiczak A. Jaśkowski S. Jeffrey R.C. Jensen R. B. Jiang Zhingen Jockusch C. G. Jr. Johnson N. JonesJP Joseph D. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.