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
Vučkovich V.D. [1974] Almost recursivity and partial degrees Z. math. Logik und Grundl. Math., 20, № 5, 419-426 75.08.90 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Li Xiang [1982] Effectively immune sets, program index sets and effectively simple sets Chin. J. Comput., 5, 273-279 83.B2.827 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Remmel J. B [1976] Co-hypersimple structures J. Symbolic Logic, 41, № 3, 611-625 77.04.85 77.07.41 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G. [1989] Recursively enumerable m - and tt -degrees, I. The quantity of m -degrees J. Symbolic Logic, 54, № 2, 553-567 90.07.34 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Boon W.W., Cannonito F.B., Lyndon R.C. [1973] Word problems: Decision problems and the Bernside problem in group theory North-Holland 74.05.264 book Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.McLaughlin T.G. [1967] Some counterexample in the theory of regressive sets Z. math. Logik und Grundl. Math., 13, № 1, 81-87 67.11.73 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cohen P.F., Jockusch C. G. Jr. [1975] A lattice property of Post’s simple sets Ill. J. Math. 19 , № 3, 450-453 77.04.56 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Shoenfield J.R. [1960] Degrees of models J. Symbolic Logic, 25, № 3, 233-237 63.01.85 OSG article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kalmár L. [1956] Ein direkter Beweis für die allgemein-recursive Unlösbarkeit des Entscheidungsproblems des Prädikatenkalküls der ersten Stufe mit Identität Z. math. Logik und Grundl. Math., 2, № 1, 1-14 58.01.69 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Robinson R.W. [1971] Jump restricted interpolation in the recursively enumerable degrees Ann. Math., 93, № 3 , 586-596 72.01.99 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Crossley J. N. [1965] Constructive order types, I Formal Systems and Recursive Functions, Amsterdam, 189-264 65.12.113 R article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hirose K. [1968] An investigation on degree of unsolvability J. Math. Soc. Japan, 20, № 4, 609-633 69.05.64 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Slaman T.A. [1998] Mathematical definability Truth mathematics, (Mussomeli, 1995), Oxford Univ. Press, NY, 233-251 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Stob M. [1982] Invariance of properties under automorphisms of the lattice of recursively enumerable sets Pacif. J. Math., 100, № 2 , 445-471 83.01.31 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hay L. [1974] A noninitial segment of index sets J. Symbolic Logic, 39, № 2, 209-224 75.08.101 EO article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Yuefei Sui [1993] On the problem of the critical bound Acta Math. Sinica, 9, № 3, 225-230 94.05.72 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Young P.R. [1965] On semi-cylinders, splinters and bounded truth-table reducibility Trans. Amer. Math. Soc., 115, № 3, 329-339 67.05.54 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Friedman Sy D. [1983] Some recent developments in higher recursion theory J. Symbolic Logic, 48, № 3, 629-642 84.07.52 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., McEvoy K. [1985] On minimal pairs of enumeration degrees J. Symbolic Logic, 50, № 4, 983-1001 86.09.40 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Shoenfield J.R. [1960] An uncountable set of incomparable degrees Proc. Amer. Math. Soc., 11, № 1, 61- 62 61.04.76 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hebeison F. [1978] Charakterisierung der Aufzöhlungsreduzierbarkeit Arch. Math. Logik Grundl., 19, №1-2, 89-95 79.08.37 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ambos-Spies K., Fleischhack H., Huwig H. [1987] Diagonalizations over polynomial time computable sets Theor. Comput. Sci., 51, № 1-2, 177-204 88.Г2.328 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Mytilinaios M.E., Slaman T.A. [1988] Σ 2 -collection and the infinite injury priority methods J. Symbolic Logic, 53, № 1, 212-221 88.09.81 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kechris A.S., Moschovakis Y.N. [1977] Recursion in higter types Handbook of Mathematic Logic, p. C, 681-737, North-Holland (Русский перевод в Справочной книге по математической логике, ч. III , (Ершов Ю.Л....
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Zheng Xizhong [1992] On the minimal covers for set of degrees Chin. Ann. Math., A13, № 6, 728-733 93.10.93 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Grzegorczyk A. [1956] Some proofs of undecidability of arithmetics Fund. Math., 43, 178-189 59.2236 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.McCarthy C. [1986] Realizability and recursive set theory Ann. Pure Appl. Logic, 32, № 2, 153-183 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Minsky M.L. [1967] Computations:Finite and infinite machines Prentice-Hall, Inc., N.J (Имеется русский перевод.) ? O book Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1973] Minimal degrees and the jump operator J. Symbolic Logic, 38 , № 2, 249-271 74.07.117 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.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.Robinson R.M. [1947] Primitive recursive functions Bull. Amer. Math. Soc., 53, № 10, 925-942 ~ EO article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G. [1989] A contiguous nonbranching degree Z. math. Logik und Grundl. Math., 35, № 4, 375-383 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Smullyan R.M. [1963] Creativity and effective inseparability Trans. Amer. Math. Soc., 109, № 1, 135-145 64.11.72 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Case J. [1976] Sortability and extensibility of the graphs of recursively enumerable partial and total orders Z. math. Logik und Grundl. Math., 22, № 1, 1-18 76.12.80 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ditchev A.V. [1991] Examples of structures which do not admit recursive presentations Ann.Univ. Sofia Fac. Math., Inform., 1991 (1993), 85, 3-11 95.10.37 G article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Machtey M. [1971] Admissible ordinals and lattice of α-R.E. sets Ann. Math. Logic, 2, № 4, 379-417 71.10.21 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hirschfeldt D. R., Khoussainov B. M., Shore R. A. Slinko A. [2002] Degree spectrs and computable dimension in algebraic structures Ann. Pure Appl. Logic, 115, № 1-3, 71-113 08.01.215 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lerman M. [2000] A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees Ann. Pure Appl. Logic, 101, № 2-3, 275-297 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hu Shin hua, Loh Chang-wan [1960] Theory of recursive algorithms. II. Kernel functions, III. Normal form of recursive functions Sci. sinica, 9, № 7, 876-896 61.08.67 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Simpson S.G. [1975] Minimal covers and hyperdegrees Trans. Amer. Math. Soc., 209, № 1, 45-64 77.01.47 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Sacks G.E. [1964] A maximal set which is not complete Michigan Math. J., 11, № 3, 193-205 65.07.64 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Scott D. [1972] Continuous lattices Lect. Notes in Math., 274 , 97-136, Springer-Verlag 73.01.44 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jockusch C.G. Jr. [1972] Degrees in which the recursive sets are uniformly recursive Canad. J. Math., 24, № 6, 1092 -1099 73.07.94 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Selivanov V.L. [1996] Finе hiеrarсhy and dеfinability in the Lindеnbaum algеbra Logiс Coll.’93 , Oxford, 425-452 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Menzel W., Sperschneider V. [1984] Recursively enumerable extensions of R 1 by finite functions. Lect. Notes in Comp. Sci., 171, 62-76, Springer -Verlag 85.02.59 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Robinson J. [1967] An introduction to hyperarithmetical functions J. Symbolic Logic, 32, № 3, 325-342 69.02.73 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Slaman T.A. [1991] Degree structures Proc. Inter. Congress of Mathematicians., (Kyoto, 1990), Math. Soc. Japan, 303-316 95.05.55 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Smullyan R.M. [1960] Theories with effectively inseparable nuclei Z. math. Logik und Grundl. Math., 6 , № 3-4, 219-224 61.12.142 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Soare R.I. [1996] Computability and recursion Bull. Symbolic Logic, 2, № 3, 284-321 01.10.113 G article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Robinson R.W. [1971] Interpolation and embedding in the recursively enumerable degrees Ann. Math., 93, № 2, 285-314 71.11.98 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.