24 found
Order:
  1. R. O. Gandy & C. E. M. Yates (1970). Meeting of the Association for Symbolic Logic Manchester 1969. Journal of Symbolic Logic 35 (4):598-613.
  2.  7
    C. E. M. Yates (1966). A Minimal Pair of Recursively Enumerable Degrees. Journal of Symbolic Logic 31 (2):159-168.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   19 citations  
  3.  1
    G. Kreisel, R. O. Gandy & C. E. M. Yates (1975). Some Reasons for Generalizing Recursion Theory. Journal of Symbolic Logic 40 (2):230-232.
    Direct download  
     
    Export citation  
     
    My bibliography   8 citations  
  4.  8
    C. E. M. Yates (1970). Initial Segments of the Degrees of Unsolvability Part II: Minimal Degrees. Journal of Symbolic Logic 35 (2):243-266.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  5.  2
    C. E. M. Yates (1962). Recursively Enumerable Sets and Retracing Functions. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 8 (3-4):331-345.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  6.  2
    C. E. M. Yates (1962). Recursively Enumerable Sets and Retracing Functions. Mathematical Logic Quarterly 8 (3‐4):331-345.
  7.  6
    C. E. M. Yates (1967). Arithmetical Sets and Retracing Functions. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (13-14):193-204.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  8.  15
    P. Aczel, J. B. Paris, A. J. Wilkie, G. M. Wilmers & C. E. M. Yates (1986). European Summer Meeting of the Association for Symbolic Logic: Manchester, England, 1984. Journal of Symbolic Logic 51 (2):480-502.
  9. C. E. M. Yates (1967). Review: Gerald E. Sacks, On a Theorem of Lachlan and Martin. [REVIEW] Journal of Symbolic Logic 32 (4):529-529.
     
    Export citation  
     
    My bibliography  
  10. C. E. M. Yates & John N. Crossley (1970). Recursively Enumerable Degrees and the Degrees Less Than 0. Journal of Symbolic Logic 35 (4):589-589.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  11. C. E. M. Yates (1967). Review: T. G. McLaughlin, Co-Immune Retraceable Sets. [REVIEW] Journal of Symbolic Logic 32 (1):123-123.
     
    Export citation  
     
    My bibliography  
  12.  2
    C. E. M. Yates (1996). Rogers Hartley Jr., The Present Theory of Turing Machine Computability. Journal of the Society for Industrial and Applied Mathematics, Vol. 7 (1959), Pp. 114–130. [REVIEW] Journal of Symbolic Logic 31 (3):513-513.
    Direct download  
     
    Export citation  
     
    My bibliography  
  13.  2
    C. E. M. Yates (1975). Review: G. Kreisel, R. O. Gandy, C. E. M. Yates, Some Reasons for Generalizing Recursion Theory. [REVIEW] Journal of Symbolic Logic 40 (2):230-232.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  14.  1
    C. E. M. Yates (1971). Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW] Journal of Symbolic Logic 36 (1):141-146.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  15.  1
    C. E. M. Yates (1968). Review: K. I. Appel, No Recursively Enumerable Set is the Union of Finitely Many Immune Retraceable Sets. [REVIEW] Journal of Symbolic Logic 33 (4):621-621.
  16. C. E. M. Yates (1966). Review: Dov Tamari, Une Contribution aux Theories de Communication: Machines de Turing Et Problemes de Mot. [REVIEW] Journal of Symbolic Logic 31 (1):139-140.
     
    Export citation  
     
    My bibliography  
  17.  1
    C. E. M. Yates (1968). Review: K. I. Appel, T. G. McLaughlin, On Properties of Regressive Sets. [REVIEW] Journal of Symbolic Logic 33 (4):621-621.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  18.  1
    C. E. M. Yates (1967). Review: T. G. McLaughlin, Some Observations on Quasicohesive Sets. [REVIEW] Journal of Symbolic Logic 32 (2):270-270.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  19.  1
    C. E. M. Yates (1973). Review: Daniel Lacombe, La Theorie des Fonctions Recursives et ses Applications. [REVIEW] Journal of Symbolic Logic 38 (3):526-526.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  20. C. E. M. Yates (1967). Review: Donald A. Martin, On a Question of G. E. Sacks. [REVIEW] Journal of Symbolic Logic 32 (4):528-529.
     
    Export citation  
     
    My bibliography  
  21. C. E. M. Yates (1996). Rogers Hartley Jr., On Universal Functions. Proceedings of the American Mathematical Society, Vol. 16 (1965), Pp. 39–44. [REVIEW] Journal of Symbolic Logic 31 (3):513-513.
    Direct download  
     
    Export citation  
     
    My bibliography  
  22. C. E. M. Yates (1966). Review: Hartley Rogers, On Universal Functions. [REVIEW] Journal of Symbolic Logic 31 (3):513-513.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  23. C. E. M. Yates (1966). Review: Hartley Rogers, The Present Theory of Turing Machine Computability. [REVIEW] Journal of Symbolic Logic 31 (3):513-513.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  24. C. E. M. Yates (1996). Tamari Dov. Une Contribution aux Théories de Communication: Machines de Turing Et Problèmes de Mot. Synthese, Vol. 9 Issue 3 Nos. 3–5 (1954), Pp. 205–227. [REVIEW] Journal of Symbolic Logic 31 (1):139-140.
    Direct download  
     
    Export citation  
     
    My bibliography