13 found
  1.  13
    The slow-growing and the grzecorczyk hierarchies.E. A. Cichon & S. S. Wainer - 1983 - Journal of Symbolic Logic 48 (2):399-408.
  2.  21
    Slow growing versus fast growing.S. S. Wainer - 1989 - Journal of Symbolic Logic 54 (2):608-614.
  3.  19
    Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy.S. S. Wainer - 1972 - Journal of Symbolic Logic 37 (2):281-292.
  4.  24
    Equational derivation vs. computation.W. G. Handley & S. S. Wainer - 1994 - Annals of Pure and Applied Logic 70 (1):17-49.
    Subrecursive hierarchy classifications are used to compare the complexities of recursive functions according to their derivations in a version of Kleene's equation calculus, and their computations by term-rewriting. In each case ordinal bounds are assigned, and it turns out that the respective complexity measures are given by a version of the Fast Growing Hierarchy, and the Slow Growing Hierarchy. Known comparisons between the two hierarchies then provide ordinal trade-offs between derivation and computation. Characteristics of some well-known subrecursive classes are also (...)
    Direct download (4 more)  
    Export citation  
    Bookmark   2 citations  
  5.  10
    Downey, R., Gasarch, W. and Moses, M., The structure.S. D. Friedman, W. G. Handley, S. S. Wainer, A. Joyal, I. Moerdijk, L. Newelski, F. van Engelen & J. van Oosten - 1994 - Annals of Pure and Applied Logic 70 (1):287.
  6. Ash, CJ, Stability of recursive structures in arithmetical degrees Ash, CJ, Categoric@ in hyperarithmetical degrees.D. Cenzer, P. Clote, R. L. Smith, S. S. Wainer, K. J. Compton, C. W. Henson & S. Shelah - 1988 - Annals of Pure and Applied Logic 40:307-310.
  7.  29
    Computability, enumerability, unsolvability: directions in recursion theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - New York: 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  
    Export citation  
  8. Recursion theory: its generalisations and applications: proceedings of Logic Colloquium '79, Leeds, August 1979.F. R. Drake & S. S. Wainer (eds.) - 1980 - New York: Cambridge University Press.
  9.  14
    A plus-1 theorem for sub-sections.S. S. Wainer - 1988 - Archive for Mathematical Logic 27 (2):101-105.
  10.  15
    European summer meeting of the association for symbolic logic: Leeds, 1979.F. R. Drake & S. S. Wainer - 1981 - Journal of Symbolic Logic 46 (2):435-446.
  11.  6
    The" Slow-Growing" U\ Approach to Hierarchies.S. S. Wainer - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--487.
    No categories
    Direct download  
    Export citation  
  12.  4
    1997 European Summer Meeting of the Association for Symbolic Logic.M. Hyland Hodges, A. H. Lachlan, A. Louveau, Y. N. Moschovakis, L. Pacholski, A. B. Slomson, J. K. Truss & S. S. Wainer - 1998 - Bulletin of Symbolic Logic 4 (1):55-117.
  13.  4
    A hierarchy for the 1-section of any type two object.S. S. Wainer - 1974 - Journal of Symbolic Logic 39 (1):88-94.