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
Nies A. [1993] Interpreting true arithmetic in degree structures Lect. Notes in Comp. Sci., 713, 255-263, Springer -Verlag ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hay L. [1973] The class of recursively enumerable subsets of a recursively enumerable set Pacif. J. Math., 46, № 1, 167-183 74.01.93 EOS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Posner D. B. [1980] A survey of non-r.e. degrees ≤ 0 / London Math. Soc. Lect. Notes, Cambridge Univ. Press, 45, 52-109 81.03.48 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Burkard E., Lerman M., Wald K. [2003] Homomorphisms and quotients of degree structure Ann. Pure Appl. Logic, 123, № 1-3, 193-233 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Crossley J. N., Remmel J.B. [1983] Undecidability and recursive equivalence, I Proc. South. Asian Conf. on Logic, (Singapore, 1981), North-Holland, 37-53 ? G article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Fenner S. [1994] Almost weakly 2-generic sets J. Symbolic Logic, 59, № 3, 868-887 95.05.54 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Davis M. [1963] Extensions and corollaries of recent work on Hilbert’s tenth problem Ill. J. Math., 7, № 2, 246-250 (Русский перевод в сб. Математика , 1964, 8, № 5, 80-84.) 64.03.55 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. (et al. eds) [1996] Computability, Enumerability, Unsolvability: directions in Recursion Theory London Math. Soc. Lect. Notes, 224, Cambridge Univ. Press ? book Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Dekker J.C.E. [1965] Closure properties of regressive functions Proc. London Math. Soc., 14, № 2, 226-238 66.08.68 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hinman P.G. [1984] Finitely approximable sets Lect. Notes in Math., 1104, 233-258, Springer-Verlag 85.09.33 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Longo G. [1979] Ricorsivita’ nei tipi superiori: un’introduzione alle caratterizzazioni di Erschov ed Hyland Rend. sem . mat. Univ. politechn., Torino, 37, № 3, 1-29 80.12.49 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kleene S.C. [1936] General recursive functions of natural numbers Math. Ann., 112, № 5, 727-742 ~ ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G., Hirschfeldt D. R, , Miller J. S., Nies A. [2005] Relativizing Chaitin’s halting probability J. Math. Logic, 5, № 2, 167-192 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Paterson M.S. [1970] Unsolvability in 3x3 matrices Studies. Appl. Math., 49, № 1, 105-107 70.07.324 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Borodin A. [1972] Computational complexity and the existence of complexity gaps J. Ass. Comp. Mach., 19, 158-174 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Shore R.A. [1984] The arithmetical degrees are not elementarily equivalent to the Turing degrees Arch. Math. Logik Grundl., 24, № 3-4 , 137-139 85.07.69 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Spreen D. [2001] Representations versus numberings: on the relationship of two computability notions Theor. Comp. Sci. 263, 473-499 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ding Decheng [1993] Every p -generic r.e.degrees is meet-inaccessible Chin. Ann. Math., 14, № 5, 542-547 94.06.94 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lerman M. [1978] Lattices of α-recursively enumerable sets General Recursion Theory, II, Proc. Symp. (Oslo, 1977), 223-238, North Holland 79.07.72 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Florence J.B. [1975] On splitting an infinite recursively enumerable class Canad. J. Math., 27, № 5, 1127-1140 76.08.100 EO article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Shore R.A. [2008] Rigidity and biinterpretability in the hyperdegrees Proc. IMS Workshop "Computational Prospects of Infinity", (Singapore, 2005), Lect. Notes Series, 15, Institute Math. Sci., Nat. Univ. Singapore, 299-312 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Jockusch C.G. Jr. [1969] The degrees of hyperhyperimmune sets J. Symbolic Logic, 34, № 3, 489-493 70.05.64 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Downey R. G. [1984] Bases of supermaximal subspaces and Steinitz systems, I J. Symbolic Logic, 49, № 4, 1146-1159 85.08.58 G article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Harrington L. A., Soare R.I. [1996] The Δ 2 0 -automorphism method and noninvariant classes of degrees J. Amer., Math. Soc., 9, № 3, 617-666 01.10.128 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Smullyan R.M. [1958] Undecidability and recursive inseparability Z. math. Logik und Grundl. Math., 4, № 2, 143-147 59.10732 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Nerode A., Remmel J.B. [1989] Complexity theoretic algebra, II: Boolean algebras Ann. Pure Appl. Logic, 44, № 1-2, 71-99 ? G article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ryan B.E. [1975] Co-cohesive sets Trans. Amer. Math. Soc., 202, № 2, 161-171 75.10.77 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Soare R.I. [1977] Computational complexity, speedable and levelable sets J. Symbolic Logic, 42, № 4, 545-563 78.12.60 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hammond T. [2002] Congruence relations on lattices of recursively enumerable sets. J. Symbolic Logic, 67, № 2, 497-504 05.08.94 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Stockmeyer L.J. [1976] Polynomial time hierarchy Theor. Comput. Sci., 3, № 1, 1-22 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Soare R.I. [1969] A note on degrees of subsets J. Symbolic Logic, 34, № 2, 256 70.01.65 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Hemachandra L.A. [1989] The strong exponential hierarchy collapses J. Comp. and Syst. Sci., 39, № 3, 299-322 90.ВН6.41 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Heller A. [1990] An existence theorem for recursion categories J. Symbolic Logic, 55, № 3, 1252-1268 91.04.63 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Afshari B., Barmpalias G., Cooper S.B. [2006] Immunity properties and n -c.e. hierarchy Lect. Notes in Comp. Sci., 3959, 694-703, Springer –Verlag ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kleene S.C. [1959] Recursive functionals and quantifiers of finite type, I Trans. Amer. Math. Soc., 91, № 1, 1-52 60.11181 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Badaev S.A., Goncharov S.S. [2000] Theory of numberings: open problems Contemporary Math., 257, 23-38 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Tarski, A., Mostowski A., Robinson R.M. [1953] Undecidable theories North-Holland 58.2684 SOR book Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Lachlan A.H. [1976] Countable initial segments of the degrees of unsolvability J. Symbolic Logic, 41, № 2, 289-300 77.03.58 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ambos-Spies K., Soare R.I. [1989] The recursively enumerable degrees have infinitely many-one types Ann. Pure Appl. Logic, 44, № 1-2 , 1-23 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Calude C., Istrate G., Zimand M. [1992] Recursive Baire classification and speedable functions Z. math. Logik und Grundl. Math., 38, № 2, 169-178 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Feferman S. [1957] Degrees of unsolvability associated with classes of formalized theories J. Symbolic Logic, 22 , № 2, 161-175 58.4449 ROS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kleene S.C. [1944] On the form of the predicates in the theory of constructive ordinals Amer. J. Math., 66, № 1, 41-58 ~ article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.McLaughlin T.G. [1968] A theorem on intermediate reducibilities Proc. Amer. Math. Soc., 19, № 1, 87-90 68.09.61 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Owings J.C. [1967] Recursion, metarecursion and inclusion J. Symbolic Logic, 32, № 2, 173-178 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cholak P. (et al. eds) [2000] Computability Theory and Its Applications: current trend and open problems Contemporary Math., 257 01.ВН8.07 book Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cholak P., Downey R. G. [1994] Permutations and presentations Proc. Amer. Math. Soc., 122, № 4, 1237-1249 95.06.201 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Chong C.T., Mourad K. J. [1992] Σ n -definability without Σ n -induction Trans. Amer. Math. Soc., 334, № 1, 349-363 93.11.86 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Robinson J. [1959] The undecidability of algebraic rings and fields Proc. Amer. Math. Soc., 10, № 6, 950-957 61.03.234 G article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Greenberg N., Shore R.A., Slaman T.A. [2006] The elementary theory of the metarecursively enumerable degrees J. Math. Logic, 6, № 1, 380-397 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Kučera A. , Slaman T.A. [2006] Turing incomparability in Scott sets Proc. Amer. Math. Soc., 135, № 11, 3723-3731 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.