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
Ehrenfeucht A. [1961] Separable theories Bull. Acad. Polon. sci., Ser. math., astron. et phys., 9, № 1, 17-19 61.12.144 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ehrenfeucht A., Feferman S. [1960] Representability of r.e. sets in formal theories Arch. Math. Logik Grundl., 5, № 1-2, 37-41 61.03.96 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.E Ebbinghaus H.D. Ehrenfeucht A. Eilenberg S. Eisenberg E.F. Elgot C.C. Ellentuck E. EndertonG EndertonHB Englert B. Epstein R.L. Ershov Yu. L. Eršov Yu.L. Вернуться на главную страницу
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Reed R.C. [1991] A decidable Ehrenfeucht theory with exactly two hyperarithmetic models Ann. Pure Appl. Logic, 53, № 2, 135-168 91.12.59 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Millar T. S. [1985] Decidable Ehrenfeucht theoris Proc. Summer Institute on Recursive Theory (Ithaca, New York), Lect. Notes in Math. 42, 311-322, Springer-Verlag 86.04.89 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lempp S., Slaman T. [2007] The complexity of the index sets of ℵ 0 -categorical theories and of Ehrenfeucht theories Advances in logic (North Texas logic conf.), Providence RI: Amer. Math. Soc., 43-47 09.06.97 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.