Search results

Scott D. [1976] Data types as lattices SIAM J. Comput., 5, № 3, 522-587 77.B11.937 article Вернуться к поиску

Scott D. [1972] Continuous lattices Lect. Notes in Math., 274 , 97-136, Springer-Verlag 73.01.44 O article Вернуться к поиску

Scott D. [1975] Data types as lattices Lect. Notes in Math., 499, 579-651, Springer-Verlag 76.07.80 O article Вернуться к поиску

Scott D. [1975] Lambda Calculus and Recursion Theory Proc. III Scan. Logic Symp., North-Holland, 154-193 ? O article Вернуться к поиску

Scott D. [1962] Algebras of sets binumerable in complete extentions of arithmetic Recursive Functions Theory, Proc. Symp. Pure Math., 5, Amer. Math. Soc., Providence, R.I., 117-121 68.04.53 OS article Вернуться к поиску

Scott D. [1970] Outline of a mathematical theory of a computation Proc. IV Conf. on for. sci. and systems, (Princeton, New Jersy, 1970), Princeton Univ. Press, 169-176 ( Русский перевод в Киберн. сб., 197б, 14, 105-121.) ? article Вернуться ...

Nadel M.E. [1974] Scott sentences and admissible sets Ann. Math. Logic., 7, № 2-3, 267-294 75.05.107 article Вернуться к поиску

Kučera A. , Slaman T.A. [2006] Turing incomparability in Scott sets Proc. Amer. Math. Soc., 135, № 11, 3723-3731 ? article Вернуться к поиску

Khoussainov B. M., Shore R. A. [1998] Computable isomorphisms, degree spectra of relations, and Scott families Ann. Pure Appl. Logic, 93, № 2, 153-193 ? 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 V.L. Selman A.L. Semenov A.L. Semukhin P. Shapiro N. Shavrukov V. Yu. Shelach S. Shen A.Kh. Shepherdson J.C. Shi Nian Dong Shinoda J. Shlapentokh A. Shoenfield J.R. Shore R.A. Silibovski S. Simon J. Simpson ...