Search results

McLaughlin T. G. [2000] A note on eventually computable functions Tex. J. Sci., 52, № 1, 59–64 05.08.105 article Вернуться к поиску

McLaughlin T.G. [1967] Splitting and decomposition by regressive sets, II Canad. J. Math., 19, № 2, 291-311 68.07.71 article Вернуться к поиску

McLaughlin T.G. [1968] A theorem on intermediate reducibilities Proc. Amer. Math. Soc., 19, № 1, 87-90 68.09.61 S article Вернуться к поиску

McLaughlin T.G. [1962] A note on contraproductive domains Math. Scand., 11 , № 2, 175-178 64.04.83 O article Вернуться к поиску

McLaughlin T.G. [1979] Retraceable homogeneous sets Fund. Math., 103, № 3, 223-229 79.12.44 article Вернуться к поиску

McLaughlin T.G. [1964] A note on pseudo doubly creative pairs Notre Dame J. Formal Logic., 5 , № 1, 24-26 65.12.91 E article Вернуться к поиску

McLaughlin T.G. [1965] Co-immunne retraceable sets Bull. Amer. Math. Soc., 71, № 3, 523-525 66.04.36 article Вернуться к поиску

McLaughlin T.G. [1965] Strong reducibility on hypersimple sets Notre Dame J. Formal Logic., 6 , № 3, 229-234 67.07.88 O article Вернуться к поиску

McLaughlin T.G. [1982] Regressive sets and the theory of isols Dekker ? O book Вернуться к поиску

McLaughlin T.G. [1965] Splitting and decomposition by regressive sets Michigan Math. J., 12, № 4, 499-505 66.08.73 article Вернуться к поиску

McLaughlin T.G. [1965] On relative coimmunity Pacif. J. Math., 15, № 4, 1319-1327 67.08.42 article Вернуться к поиску

McLaughlin T.G. [1972] Complete index sets of recursively enumerable families Compositio math., 24, № 1, 83-91 72.08.92 E article Вернуться к поиску

McLaughlin T.G. [1964] Some observations on quasicohesive sets Michigan Math. J., 11, № 1, 83-87 65.09.60 article Вернуться к поиску

McLaughlin T.G. [1963] A theorem on productive functions Proc. Amer. Math. Soc., 14, № 3, 444 64.02.92 article Вернуться к поиску

McLaughlin T.G. [1963] A remark of semiproductive sets Monatsh. Math., 67, № 2, 97-100 64.02.93 O article Вернуться к поиску

McLaughlin T.G. [1962] On an extension of a theorem of Friedberg Notre Dame J. Formal Logic., 3 , 270-273 ? RO article Вернуться к поиску

McLaughlin T.G. [1965] On a class of complete simple sets Canad. Math. Bull., 8, № 1, 33-37 65.11.82 OS article Вернуться к поиску

Barback J., McLaughlin T.G. [1978] On intersections of regreeive sets Pacif. J. Math., 79, № 1, 19-35 79.09.56 article Вернуться к поиску

McLaughlin T.G. [1973] On retraceable sets with rapid growth Proc. Amer. Math. Soc., 40, № 2, 573-576 74.06.121 O article Вернуться к поиску

McLaughlin T.G. [1966] Retraceable sets and recursive permutations Proc. Amer. Math. Soc., 17 , № 2, 427-429 67.02.65 OS article Вернуться к поиску

McLaughlin T.G. [1972] Supersimple sets and the problem of extending a retracing function Pacif. J. Math., 41, № 2, 485-494 73.02.39 article Вернуться к поиску

McLaughlin T.G. [1986] Some elementary degree-theoretic reasons why structures need similarity types J. Symbolic Logic, 51, № 3, 732-747 87.04.42 article Вернуться к поиску

McLaughlin T.G. [1966] Two remarks an indecomposable number sets Z. math. Logik und Grundl. Math., 12, № 3, 183-190 67.03.49 article Вернуться к поиску

McLaughlin T.G. [1974] Closed basic retracing functions and hyperimmune sets Z. math. Logik und Grundl. Math., 20, № 1, 49-52 75.03.92 article Вернуться к поиску

McLaughlin T.G. [1964] On contraproductive sets which are not productive Z. math. Logik und Grundl. Math., 10 , № 1, 49-52 65.02.130 O article Вернуться к поиску

McLaughlin T.G. [1964] A note on product systems of sets of natural numbers Amer. Math. Monthly, 71, № 6, 653-655 65.05.47 article Вернуться к поиску

Appel K.I., McLaughlin T.G. [1965] On properties of regressive sets Trans. Amer. Math. Soc., 115 , № 3, 83-93 66.05.54 RO article Вернуться к поиску

McLaughlin T.G. [1967] Some counterexample in the theory of regressive sets Z. math. Logik und Grundl. Math., 13, № 1, 81-87 67.11.73 article Вернуться к поиску

Jockusch C.G. Jr., McLaughlin T.G. [1969] Countable retracing functions and Π 2 0 predicates Pacif. J. Math., 30, № 1 ,67-93 70.04.82 OS article Вернуться к поиску

McLaughlin T.G. [1971] The family of all recursively enumerable classes of finite sets Trans. Amer. Math. Soc., 155, № 1, 127-136 72.01.97 EO article Вернуться к поиску

McLaughlin T.G. [1973] A non-enumerability theorem for infinite classes of finite structures Word Probl. Decis. Probl. and Burside Probl. Group Theory, Amsterdam-london, 479-481 74.06.74 article Вернуться к поиску

McLaughlin T.G. [1967] Some remarks on extensibility confluence of paths branching properties and index sets for certain recursively enumerable graphs Ill. J. Math., 11, № 2, 257-279 68.08.53 article Вернуться к поиску

... Mainhardt G. Maksimova L. L. Malcev A.I. Manasse M. Manaster A. B. Marandzjan G. B. Marcone A. Marker D. Marques I. MartinDA MartinG Matiyasevich Yu.V. Mayoh B.H. McCarthyC McCarthyJ McCoy Ch.F.D. McCreight E.M. McEvoy K. McKenzie R. McKinsey J. C. C. McLaughlin T.G. McNicholl T. H. McNulty G. Melhorn K. Melzak Z.A. Mendelson E. Menzel W. Merkle W. Metakides G. MeyerAR Mihailovich N. J. Mileti J.R. MillarRC MillarTS MillerD MillerJS MillerRG MillerS MillerW Mills C.F. Minsky M.L. Mitchell R. Moggi E. Moh Shaw-kwei ...