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

Stoltenberg-Hansen V. [1980] On computational complexity in weakly admissible structures J. Symbolic Logic, 45, № 2, 353-358 81.01.34 article Вернуться к поиску

Stoltenberg-Hansen V., Tucker J. V. [1999] Computable rings and fields Handbook of Computability Theory, Elsevier, 363-447 ? article Вернуться к поиску

Normann D., Palmgren E., Stoltenberg-Hansen V. [1999] Hyperfinite type structures J. Symbolic Logic, 64, № 3, 1216-1242 02.04.65 article Вернуться к поиску

Stoltenberg-Hansen V., Tucker J. V. [1995] Effective algebras Handbook of Logic in Computer Science, 4, 357-526, Oxford Univ. Press, NY ? G article Вернуться к поиску

Normann D., Stoltenberg-Hansen V. [1978] A non-adequate admissible set with good degree structure General Recursion Theory, II, Proc. Symp. (Oslo, 1977), 321-329, North- Holland 79.08.39 article Вернуться к поиску

... SolomonDR SolomonR Solon B. Solovay R.M. Sorbi A. SoskovIN SoskovaAA SoskovaMI Spector C. Sperschneider V. Spreen D. Stanley L. Stearns R.E. Steel J.R. Stefani S. Stephan F. Stephen B. Stewart F.M. Steyaert J.M. Stillwell J. Stob M. Stockmeyer L.J. Stoltenberg-Hansen V. StrongHR Sturgis H. E. Su Kaile Surányi J. Suzuki Y. Szmielew W. Вернуться на главную страницу