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
Cooper S.B., Truss J.K.(eds) [1999] Models and computability J. London Math. Soc., 259 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [2001] On a conjecture of Kleene and Post Math. Logic Quarterly, 47, № 1, 3-33 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [2006] Definability as hypercomputational effect App. Math. and Comput., 178, № 1, 72-82 08.ВН3.58 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1982] Partial degrees and the density problem, I J. Symbolic Logic, 47, № 4 , 854-859 83.08.54 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. ? An introduction to Turing nonrigidity ? ? article Вернуться к поиску
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.Cooper S.B. [1996] Strong minimal covers for recursively enumerable degrees Math. Logic Quarterly, 42, 191-196 ? S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. ? Minimal degrees and the arithmetical hierarchy ? ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1999] Local degree theory Handbook of Computability Theory, Elsevier, 121-153 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. ? A non invariant atomic jump class ? ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1989] A jump class of non-cappable recursively enumerable degrees J. Symbolic Logic, 54, № 2 , 324-353 90.07.32 S article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [2004] Computability Theory Chapman & Hall/ CRC Press, Boch Raton, FL, NY, London ? book Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. ? The local jump-join theorem for nondeficient d.c.e. operators In prepar. ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1993] Definability and global degree theory Lect. Notes in Logic, 2, 25-45, Springer -Verlag ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1999] Upper cones as automorphism bases Sibirian Adv.in Math., 9, № 1, 1-61 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1998] Beyond Gödel theorem : Turing nonrigidity revisted Lect. Notes in Logic., 11, 44-50, Springer-Verlag ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. ? The limits of local Turing definability ? ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. ? Families containing no pairwise disjoint sets ? ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. ? The recursively enumerable degrees are absolutely definable ? ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. ? Computability enumerable singleton and Turing definability ? ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Li A. [2008] On Lachlan’s major subdegree problem Arch. Math. Logik Grundl., 47, № 5, 455-482 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Seetapun D. ? On a question of Posner ? ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Sorbi A., Yang Yue ? A capping theorem for the Δ 2 0 enumeration degrees ? ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Epstein R. L. [1987] Complementing below recursively enumerable degrees Ann. Pure Appl. logic, 34, № 1, 15-32 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Lempp S., Watson P. [1989] Weak density in the d -r.e. degrees Israel J. Math., 67, № 2, 137-152 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Barmpalias G., Cooper S.B., Lewis A. ? Minimal pairs and the Slaman-Soare phenomen In prepar. ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Ambos-Spies K. Cooper S.B., Lempp S. [1998] Initial segments of recursive linear orders Order, 14, № 2, 101-105 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Coles R. J., Cooper S.B. ? The strongest non-splitting theorem ? ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1974] Minimal pairs and high recursively enumerable degrees J. Symbolic Logic, 39, № 4, 655-660 75.09.59 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1992] A splitting theorem for the n -r.e. degrees. Proc. Amer. Math. Soc., 115, № 2, 461-471 93.08.47 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1972] Jump equivalence of the Δ 2 0 hyperhyperimmune sets J. Symbolic Logic, 37, № 3, 598-600 73.05.57 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Li A. [2002] Non-uniformity and generalized Sacks splitting Acta Math. Sinica, 18, № 2, 327-334 05.08.97 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1987] Enumeration reducibility using bounded information; counting minimal covers Z. math. Logik und Grundl. Math., 33 , № 8, 537-560 ? OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1989] The strong anti-cupping property for recursively enumerable degrees J. Symbolic Logic, 54, № 2, 527-539 90.07.33 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1991] The density of the low 2 n -r.e. degrees Arch. Math. Logik Grundl., 31, № 1, 19-24 93.04.49 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1972] Degrees of unsolvability complementary between recursively enumerable degrees, I Ann. Math. Logic, 4, № 1, 31-74 72.06.74 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Copestake C.S. [1988] Properly Σ 2 enumeration degrees Z. math. Logik und Grundl. Math., 34, № 6, 491-522 89.09.53 O 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.Cooper S.B., Li A. [2002] Turing definability in the Ershov hierarchy J. London Math. Soc., 66, № 3, 513-528 06.01.75 article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Sorbi A. [1996] Noncappable enumeration degrees below 0 e / J. Symbolic Logic, 61, № 4, 1347-1363 98.02.50 01.01.117 O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1990] Enumeration reducibility, nondeterministic computations and relative computability of partial functions Lect. Notes in Math., 1432, 57-110, Springer-Verlag ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1972] Minimal upper bounds for sequences of recursively enumerable degrees J. London Math. Soc., 5, № 3, 445-450 73.05.48 OS article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Lewis A., Yang Yue [2005] Properly Σ 2 minimal degrees and 0 // complementation Math. Logic Quarterly, 51, № 3, 274-276 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Li A. [2002] Splitting and cone avoidance in the d.c.e.degrees Sci. in China, A45, № 9, 1135-1146 05.09.79 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., Stephan F. [2007] Post’s program for the Erchov hierarchy J. Logic and Comp., 17, № 6, 1025-1040 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1996] A characterization of the jumps of minimal degrees below 0 / London Math. Soc. Lect. Notes, Cambridge Univ. Press, 224, 81-92 ? O article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B. [1996] Discontinuous phenomena and Turing definability Proc. Inter. Conf. "Algebra and Analysis”, (Kazan, Russia, 1994), Walter de Gruyter, 41-55 ? article Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Goncharov S.S.(eds) [2003] Computability and Logic Computability and models: perspectives East and West Kluwer Academic/Plenum Publishers ? book Вернуться к поиску
Path: Ivannikov Institute for System Programming of the Russian Academy of Sciences / Bibliography of Lavrov I.A.Cooper S.B., Li A., Sorbi A., Yang Yue [2003] There exists a maximal 3-c.e. enumeration degree Israel J. Math., 137, 285-320 ? 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.