13 found
Sort by:
  1. M. Hyland Hodges, A. H. Lachlan, A. Louveau, Y. N. Moschovakis, L. Pacholski, A. B. Slomson, J. K. Truss & S. S. Wainer (1998). 1997 European Summer Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic 4 (1).
     
    My bibliography  
     
    Export citation  
  2. S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
    The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. S. D. Friedman, W. G. Handley, S. S. Wainer, A. Joyal, I. Moerdijk, L. Newelski, F. van Engelen & J. van Oosten (1994). Downey, R., Gasarch, W. And Moses, M., The Structure. Annals of Pure and Applied Logic 70:287.
     
    My bibliography  
     
    Export citation  
  4. W. G. Handley & S. S. Wainer (1994). Equational Derivation Vs. Computation. Annals of Pure and Applied Logic 70 (1):17-49.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Peter Aczel, Harold Simmons & S. S. Wainer (eds.) (1992). Proof Theory: A Selection of Papers From the Leeds Proof Theory Programme, 1990. Cambridge University Press.
    This work is derived from the SERC "Logic for IT" Summer School Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles which form an invaluable introduction to proof theory aimed at both mathematicians and computer scientists.
    Direct download  
     
    My bibliography  
     
    Export citation  
  6. S. S. Wainer (1989). Slow Growing Versus Fast Growing. Journal of Symbolic Logic 54 (2):608-614.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  7. D. Cenzer, P. Clote, R. L. Smith, S. S. Wainer, K. J. Compton, C. W. Henson & S. Shelah (1988). Ash, CJ, Stability of Recursive Structures in Arithmetical Degrees Ash, CJ, Categoric@ in Hyperarithmetical Degrees. Annals of Pure and Applied Logic 40:307-310.
     
    My bibliography  
     
    Export citation  
  8. S. S. Wainer (1988). A Plus-1 Theorem for Sub-Sections. Archive for Mathematical Logic 27 (2):101-105.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. S. S. Wainer (1985). The" Slow-Growing" U\ Approach to Hierarchies. In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. 42--487.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. E. A. Cichon & S. S. Wainer (1983). The Slow-Growing and the Grzecorczyk Hierarchies. Journal of Symbolic Logic 48 (2):399-408.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  11. F. R. Drake & S. S. Wainer (1981). European Summer Meeting of the Association for Symbolic Logic: Leeds, 1979. Journal of Symbolic Logic 46 (2):435-446.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. S. S. Wainer (1974). A Hierarchy for the 1-Section of Any Type Two Object. Journal of Symbolic Logic 39 (1):88-94.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. S. S. Wainer (1972). Ordinal Recursion, and a Refinement of the Extended Grzegorczyk Hierarchy. Journal of Symbolic Logic 37 (2):281-292.