Библиография Лаврова И.А.

Sacks G. [1999] E -recursion Handbook of Computability Theory, Elsevier, 301-314 ? article Вернуться к поиску

Sacks G.E. [1980] Higher Recursion Theory Springer-Verlag ? O book Вернуться к поиску

Sacks G.E. [1971] On the reducibility of Π 1 1 sets Adv. in Math., 7, № 1, 57-82 72.05.52 article Вернуться к поиску

Sacks G.E. [1976] Countable admissible ordinals and hyperdegrees Adv. in Math., 20, № 2, 213-262 77.01.35 S article Вернуться к поиску

Sacks G.E. [1977] R.e. sets higher up Logic, Foundat of Math. Comp. Dordrecht-Nolland, 1970, 173-194 ? S article Вернуться к поиску

Sacks G.E. [1964] The recursively enumerable degrees are dense Ann. Math, 80, № 2, 300-312 65.02.122 ROS article Вернуться к поиску

Sacks G.E. [1964] A maximal set which is not complete Michigan Math. J., 11, № 3, 193-205 65.07.64 ROS article Вернуться к поиску

Sacks G.E. [1969] Measure-theoretical uniformity Found. Math., 51-57 69.10.24 article Вернуться к поиску

Sacks G.E. [1967] Measure-theoretical uniformity Bull. Amer. Math. Soc., 73, № 1, 169-174 67.10.66 article Вернуться к поиску

Sacks G.E. [1961] A minimal degrees less than 0 / Bull. Amer. Math. Soc., 67, № 4, 416-419 62.03.59 ROS article Вернуться к поиску

Sacks G.E. [1963] On degrees less than 0 / Ann. Math., 77, № 2, 211-231 63.10.62 RS article Вернуться к поиску

Sacks G.E. [1977] The k -section of a type n object Amer. J. Math., 99, № 5, 901-917 78.07.63 S article Вернуться к поиску

Sacks G.E. [1986] The limits of E -recursive enumerability Ann. Pure Appl. Logic, 31, № 1, 87-120 ? S article Вернуться к поиску

Sacks G.E. [1971] F - recursiveness Logic Coll’69, North-Holland, 289-303 71.09.52 article Вернуться к поиску

Sacks G.E., Slaman T.A. [1990] Generalized hyperarithmetical theory Proc. London Math, Soc., 60, № 3, 417-443 91.06.40 article Вернуться к поиску

Sacks G.E., Simpson S.G. [1972] The α-finite injury method Ann. Math. Logic, 4, № 4, 343-367 73.04.84 OS article Вернуться к поиску

Sacks G.E., Slaman T.A. [1987] Inadmissible forcing Adv. in Math., 66, № 1, 1-30 88.06.59 article Вернуться к поиску

Homer S., Sacks G.E. [1983] Inverting the half-jump Trans. Amer. Math. Soc., 278, № 1, 317-331 84.01.56 S article Вернуться к поиску

Kreisel G., Sacks G.E. [1965] Metarecursive sets J. Symbolic Logic, 30, № 3, 318-338 68.07.68 RS article Вернуться к поиску

Gandy R.O., Sacks G.E. [1967] A minimal hyperdegree Fund. Math., 61, № 2, 215-223 68.07.69 article Вернуться к поиску

Sacks G.E. [1963], [1966] Degrees of unsolvability Ann. Math. Studies, 55, Princeton Univ. Press, N.J. 65.05.46 SOR book Вернуться к поиску

Sacks G.E. [1966] Metarecursively enumerabable sets and admissible ordinals Bull. Amer. Math. Soc., 72, № 1, 59-64 67.10.56 article Вернуться к поиску

Friedman Sy D., Sacks G.E. [1977] Inadmissible Recursion Theory Bull. Amer. Math. Soc., 83 , № 2, 255-256 77.12.48 0 article Вернуться к поиску

Sacks G.E. [1966] Post’s problem, admissible ordinals and regularity Trans. Amer. Math. Soc., 124, № 1, 1-23 68.01.69 OS article Вернуться к поиску

Sacks G.E. [1985] Some open questions in recursive theory Lect. Notes in Math., 1141, 333-342, Springer-Verlag 86.03.40 S article Вернуться к поиску

Sacks G.E. [1963] Recursively enumerability and the jump operator Trans. Amer. Math. Soc., 108, № 2, 223-239 64.11.73 ROS article Вернуться к поиску

Sacks G.E. [1967] On a theorem of Lachlan and Martin Proc. Amer. Math. Soc., 18, № 1, 140-141 67.10.57 OS article Вернуться к поиску

Lerman M., Sacks G.E. [1972] Some minimal pairs of α-recursively enumerable degrees Ann. Math. Logic, 4, № 4, 415-442 73.04.87 article Вернуться к поиску

Sacks G.E. [1961] On suborderings of degrees of recursive unsolvability Z. math. Logik und Grundl. Math., 7, № 1, 46-56 62.02.72 ROS article Вернуться к поиску

Sacks G.E. [1971] Recursion in objects of finite types Actes Congress Inter. Math., (Nice, 1970), v.1, Paris, Gauthier-Villars, 251-254 72.05.54 article Вернуться к поиску

Sacks G.E. [1964] A simple set which is not effectively simple Proc. Amer. Math. Soc., 15, № 1, 51- 55 64.12.64 ROS article Вернуться к поиску

Sacks G.E. [1969] Measure -theoretic uniformity in recursion theory and set theory Trans. Amer. Math. Soc., 142, № 8, 381-420 70.06.54 OS article Вернуться к поиску

Sacks G.E. [1974] The 1-section of a type n object General Recursion Theory, II, Proc. Symp. (Oslo, 1974), 81-93 North Holland 75.06.118 article Вернуться к поиску

Sacks G.E. [1980] Three aspects of recursively enumerability in higher types London Math. Soc. Lect. Notes, Cambridge Univ. Press, 45, 184-214 81.03.46 S article Вернуться к поиску

Sacks G.E. [1971] Forcing with perfect closed sets Axiomatic Set Theory, I, Proc. Symp. Pure Math., 17, (Los Angeles, 1967), Amer. Math. Soc., Providence, R.I., 331-355 ? OS article Вернуться к поиску

Sacks G.E. [1967] Metarecursion theory Sets, Models and Recursion Theory, Coll. and Summer School Math. Logic (Leichester, England, 1965), North-Holland, 243-263 69.01.80 OS article Вернуться к поиску

Sacks G.E. [1985] Post’s problem in E -recursion Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 177-193 86.03.46 S article Вернуться к поиску

Ohashi K. [1970] On a question of G. E. Sacks J. Symbolic Logic, 35, № 1, 46-50 71.04.49 article Вернуться к поиску

Martin D.A. [1966] On a question of G.E. Sacks J. Symbolic Logic, 31, № 1, 66-69 ? OS article Вернуться к поиску

Downey R. G., Yu Liang [2006] Arithmetical Sacks forcing Arch. Math. Logik Grundl., 45, № 6, 715-720 ? article Вернуться к поиску

Lachlan A.H. [1965] On a problem of G.E.Sacks Proc. Amer. Math. Soc., 16, № 5, 972-979 66.09.59 OS article Вернуться к поиску

Cooper S.B., Li A. [2002] Non-uniformity and generalized Sacks splitting Acta Math. Sinica, 18, № 2, 327-334 05.08.97 article Вернуться к поиску

Shore R.A. [1997] Conjectures and questions from G. Sacks “Degrees of Unsolvability” Arch. Math. Logik Grundl., 36, № 4-5, 233-253 01.11.64 O article Вернуться к поиску

Groszek M.J., Mytilinaios M.E., Slaman T.A. [1996] The Sacks density theorem and Σ 2 -bounding J. Symbolic Logic, 61, № 2, 450-467 01.10.123 O article Вернуться к поиску

S Sacks G.E. Salts M.C. Sanches L. Sankappanavar H.P. Sasso L.P. Schaefer M. Schaeffer B. Schäfer G. Schinzel B. Schmerl J.H. Schmidt D. Schmitz H. Schnorr C. P. Schwabhauser W. Schwarz S. T. Schwichtenberg H. Scott D. Seetapun D. Seidenberg A. Seigneur A. Selivanov ...