Search results

Jones J.P. [1982] Universal diophantine equation J. Symbolic Logic, 47, № 3, 549-571 83.03.55 article Вернуться к поиску

Jones J.P. [1980] Undecidable Diophantine equations Bull. Amer. Math. Soc., 3, № 2, 854-862 81.04.107 article Вернуться к поиску

Jones J.P. [1978] Three universal representation of recursively enumerable sets J. Symbolic Logic, 43, № 2, 335-351 79.02.61 article Вернуться к поиску

Jones J.P. [1974] Recursive undecidability – an exposition Amer. Math. Monthly, 87, № 7, 724-738 75.05.75 article Вернуться к поиску

Jones J.P. [1969] Effectively retractable theories and degrees of undecidability J. Symbolic Logic, 34, № 4, 597-604 70.11.54 article Вернуться к поиску

J Jacobs B. E. Jacobs K. Jahn M.A. Jain S. Janiczak A. Jaśkowski S. Jeffrey R.C. Jensen R. B. Jiang Zhingen Jockusch C. G. Jr. Johnson N. JonesJP Joseph D. Вернуться на главную страницу

Jones J.P., Matijasevich Yu.V. [1991] Proof of recursive unsolvability of Hilbert’s tenth problem Amer. Math. Monthly, 98, № 8, 689-709 92.09.60 article Вернуться к поиску

Jones J.P., Matijasevich Yu.V. [1984] Register machine proof of the theorem on exponential Diophantine representations of enumerable sets J. Symbolic Logic, 49, № 3, 818-829 85.04.45 O article Вернуться к поиску

Jones J.P., Matijasevich Yu.V. [1982] Exponential Diophantine representation of recursively enumerable sets Proc. Herbrand Symp. Logic (Marseilles, 1981), Studies Logic and the Foundations of Math., 107, 159-177, North-Holland ? article Вернуться к поиску