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
Friedberg R.M. [1958] Three theorems on recursive enumeration J. Symbolic Logic, 23 , № 3, 309-316 61.01.64 REOSG article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedberg R.M. [1957] A criterion for completeness of degrees of unsolvability J. Symbolic Logic, 22, № 2, 159-160 58.4451 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedberg R.M. [1958] Un contre-exemple relative aux fonctionnelles récursives Comp. Rend. Acad. Sci., (Paris), 247, № 2, 852-854 59.8726 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedberg R.M. [1957] The fine structure of degrees of unsolvability of recursively enumerable sets Summaries Cornell Univ.Summer Inst. for Symbolic Logic, 404-406 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedberg R.M., Rogers H. Jr. [1959] Reducibilities and completeness for sets of integers Z. math. Logik und Grundl. Math., 5, № 2, 117-125 63.05.62 REOS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedberg R.M. [1958] Four quatifier completeness a Banach-Mazur functional not uniformly partial recursive Bull. Acad. Polon. sci., Ser. math., astron. et phys., 6, № 1 , 1-5 59.7671 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedberg R.M. [1957] Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post’s problem 1944) Proc. Nat. Acad. Sci., USA, 43, № 2, 236-238 58.1769 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hammond T. [1999] Friedberg splitting in Σ 2 0 quotient lattices of E J. Symbolic Logic, 64, № 4, 1403-1406 05.08.96 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.MacIntyre J.M. [1977] Transfinite extensions of Friedberg’s completeness criterion J. Symbolic Logic, 42, № 1, 1-10 78.07.66 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Miller R. G. [2002] Definable incompleteness and Friedberg splittings J. Symbolic Logic, 67, № 2, 679-696 05.09.90 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ohashi K. [1964] A strong form of a theorem of Friedberg Notre Dame J. Formal Logic, 5, № 1, 10-12 67.04.58 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.McLaughlin T.G. [1962] On an extension of a theorem of Friedberg Notre Dame J. Formal Logic., 3 , 270-273 ? RO article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kummer M. [1990] An easy priority-free proof of a theorem of Friedberg Theor. Comp. Sci., 74, № 2, 249-251 91.ВН3.53 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G., Stob M. [1993] Friedberg splittings of recursively enumerable sers Ann. Pure Appl. Logic, 59, № 3, 175-199 94.06.95 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Chong C.T., Qian Lei, Yang Yue [2000] The Friedberg jump inversion theorem revisited: a study of undefinable cuts Logic Coll’98, ASL La Jolla, Cal., 140-153 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Di Paola R.A. [1981] A lift of a theorem of Friedberg : a Banach-Mazur functional that coincides with no α-recursive functional on the classe of α-recursive functions J. Symbolic Logic, 46, № 2, 216-232 81.12.49 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.... Feferman S. Feiner L. FejerL FejerPA Fellows M.R. Fenner S. Fenstad J.E. Ferrante J. Figueira S. Finkelstein M. FischerMJ FischerP Fischer.PC Fitting M. Flajolet P. Fleischhack H. Florence J.B. Fokina E.B. Fortnow L. Fotrune S. Fraissé R. Freivalds R.V. Friedberg R.M. FriedmanHM FriedmanSyD Fröhlich A. Frolov A. Füredi Z. Fukuyama M. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.