28 found
Order:
  1.  26
    A Minimal Pair of Recursively Enumerable Degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
  2.  22
    K. I. Appel and T. G. McLaughlin. On Properties of Regressive Sets. Transactions of the American Mathematical Society, Vol. 115 , Pp. 83–93. [REVIEW]C. E. M. Yates - 1969 - Journal of Symbolic Logic 33 (4):621.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  3. Meeting of the Association for Symbolic Logic Manchester 1969.R. O. Gandy & C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (4):598-613.
  4.  8
    Some Reasons for Generalizing Recursion Theory.G. Kreisel, R. O. Gandy & C. E. M. Yates - 1975 - Journal of Symbolic Logic 40 (2):230-232.
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  5.  20
    Dov Tamari. Une Contribution aux Théories de Communication: Machines de Turing Et Problèmes de Mot. Synthese, Vol. 9 Issue 3 Nos. 3–5 , Pp. 205–227. [REVIEW]C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (1):139-140.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  6.  18
    Donald A. Martin. On a Question of G. E. Sacks. The Journal of Symbolic Logic, Vol. 31 , Pp. 66–69.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (4):528-529.
  7.  16
    Hartley RogersJr., The Present Theory of Turing Machine Computability. Journal of the Society for Industrial and Applied Mathematics, Vol. 7 , Pp. 114–130. [REVIEW]C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (3):513-513.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8.  23
    Initial Segments of the Degrees of Unsolvability Part II: Minimal Degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.
  9.  17
    Recursively Enumerable Sets and Retracing Functions.C. E. M. Yates - 1962 - Mathematical Logic Quarterly 8 (3‐4):331-345.
  10.  20
    Recursively Enumerable Sets and Retracing Functions.C. E. M. Yates - 1962 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 8 (3-4):331-345.
  11.  11
    Gerald E. Sacks. On a Theorem of Lachlan and Martin. Proceedings of the American Mathematical Society, Vol. 18 , Pp. 140–141. [REVIEW]C. E. M. Yates - 1968 - Journal of Symbolic Logic 32 (4):529.
  12.  11
    Daniel Lacombe. La Théorie des Fonctions Récursives Et Ses Applications. Bulletin de la Société Mathématique de France, Vol. 88 , Pp. 393–468. [REVIEW]C. E. M. Yates - 1973 - Journal of Symbolic Logic 38 (3):526.
  13.  10
    T. G. McLaughlin. Some Observations on Quasicohesive Sets. The Michigan Mathematical Journal, Vol. 11 , Pp. 83–87.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (2):270.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  14.  42
    European Summer Meeting of the Association for Symbolic Logic, Manchester, England, 1984.P. Aczel, J. B. Paris, A. J. Wilkie, G. M. Wilmers & C. E. M. Yates - 1986 - Journal of Symbolic Logic 51 (2):480-502.
  15.  9
    Hartley RogersJr., On Universal Functions. Proceedings of the American Mathematical Society, Vol. 16 , Pp. 39–44.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (3):513-513.
  16.  29
    G. Kreisel. Some Reasons for Generalizing Recursion Theory. Logic Colloquium '69, Proceedings of the Summer School and Colloquium in Mathematical Logic, Manchester, August 1969, Edited by R. O. Gandy and C. E. M. Yates, Studies in Logic and the Foundations of Mathematics, Vol. 61, North-Holland Publishing Company, Amsterdam and London1971, Pp. 139–198. [REVIEW]C. E. M. Yates - 1975 - Journal of Symbolic Logic 40 (2):230-232.
  17.  6
    T. G. McLaughlin. Co-Immune Retraceable Sets. Bulletin of the American Mathematical Society, Vol. 71 , Pp. 523–525.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (1):123.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  18.  10
    Recursively Enumerable Degrees and the Degrees Less Than 0.C. E. M. Yates & John N. Crossley - 1970 - Journal of Symbolic Logic 35 (4):589-589.
  19.  19
    Review: G. Kreisel, R. O. Gandy, C. E. M. Yates, Some Reasons for Generalizing Recursion Theory. [REVIEW]C. E. M. Yates - 1975 - Journal of Symbolic Logic 40 (2):230-232.
  20.  12
    Reviews. Hartley Rogers Jr., Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York, St. Louis, San Francisco, Toronto, London, and Sydney, 1967, Xix + 482 Pp. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  5
    The Present Theory of Turing Machine Computability.C. E. M. Yates & Hartley Rogers - 1966 - Journal of Symbolic Logic 31 (3):513.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  12
    Review: K. I. Appel, T. G. McLaughlin, On Properties of Regressive Sets. [REVIEW]C. E. M. Yates - 1968 - Journal of Symbolic Logic 33 (4):621-621.
  23.  7
    Review: Hartley Rogers, On Universal Functions. [REVIEW]C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (3):513-513.
  24. Review: T. G. McLaughlin, Co-Immune Retraceable Sets. [REVIEW]C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (1):123-123.
  25.  4
    Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  4
    Review: Daniel Lacombe, La Theorie des Fonctions Recursives et ses Applications. [REVIEW]C. E. M. Yates - 1973 - Journal of Symbolic Logic 38 (3):526-526.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  27.  3
    Review: K. I. Appel, No Recursively Enumerable Set is the Union of Finitely Many Immune Retraceable Sets. [REVIEW]C. E. M. Yates - 1968 - Journal of Symbolic Logic 33 (4):621-621.
  28.  2
    Review: T. G. McLaughlin, Some Observations on Quasicohesive Sets. [REVIEW]C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (2):270-270.