Order:
Disambiguations
S. S. Wainer [13]Stanley S. Wainer [7]Stan S. Wainer [2]Stan Wainer [2]
S. Wainer [2]Stanley Wainer [1]Ss Wainer [1]
  1.  9
    Members of Countable Π10 Classes.Douglas Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare & Stanley S. Wainer - 1986 - Annals of Pure and Applied Logic 31 (2):145-163.
  2.  11
    The Slow-Growing and the Grzecorczyk Hierarchies.E. A. Cichon & S. S. Wainer - 1983 - Journal of Symbolic Logic 48 (2):399-408.
  3. Accessible Recursive Functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
    The class of all recursive functions fails to possess a natural hierarchical structure, generated predicatively from "within". On the other hand, many (proof-theoretically significant) sub-recursive classes do. This paper attempts to measure the limit of predicative generation in this context, by classifying and characterizing those (predictably terminating) recursive functions which can be successively defined according to an autonomy condition of the form: allow recursions only over well-orderings which have already been "coded" at previous levels. The question is: how can a (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark  
  4.  19
    Slow Growing Versus Fast Growing.S. S. Wainer - 1989 - Journal of Symbolic Logic 54 (2):608-614.
  5.  14
    Ordinal Recursion, and a Refinement of the Extended Grzegorczyk Hierarchy.S. S. Wainer - 1972 - Journal of Symbolic Logic 37 (2):281-292.
  6.  3
    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.
  7.  10
    The 1-Section of a Countable Functional.Dag Normann & Stan S. Wainer - 1980 - Journal of Symbolic Logic 45 (3):549-562.
  8.  2
    Elementary Arithmetic.Geoffrey E. Ostrin & Stanley S. Wainer - 2005 - Annals of Pure and Applied Logic 133 (1):275-292.
    There is a very simple way in which the safe/normal variable discipline of Bellantoni–Cook recursion [S. Bellantoni, S. Cook, A new recursion theoretic characterization of the polytime functions, Computational Complexity 2 97–110] can be imposed on arithmetical theories like PA: quantify over safes and induct on normals. This weakens the theory severely, so that the provably recursive functions become more realistically computable . Earlier results of D. Leivant [Intrinsic theories and computational complexity, in: D. Leivant , Logic and Computational Complexity, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  17
    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   1 citation  
  10.  22
    Program Transformation and Proof Transformation.Wilfried Sieg & Stanley S. Wainer - unknown
    Wilfred Sieg and Stanley S. Wainer. Program Transformation and Proof Transformation.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  17
    Hierarchies of Provably Recursive Functions.Stanley S. Wainer - 1998 - In Samuel R. Buss (ed.), Bulletin of Symbolic Logic. Elsevier. pp. 149.
  12.  4
    A Hierarchy for the 1-Section of Any Type Two Object.S. S. Wainer - 1974 - Journal of Symbolic Logic 39 (1):88-94.
  13.  10
    A Plus-1 Theorem for Sub-Sections.S. S. Wainer - 1988 - Archive for Mathematical Logic 27 (2):101-105.
  14.  11
    Editorial Logic Colloquium '95, Haifa, Israel.Gerhard Jaeger, Wolfram Pohlers & Stan Wainer - 1998 - Archive for Mathematical Logic 37 (5-6):273-273.
  15.  11
    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.
  16.  7
    The American Mathematical Society During January 8–11, 1997, in San Diego, California.• The 1996–97 ASL Annual Meeting Will Be Held March 22–25, 1997, at the Massachusetts Institute of Technology in Cambridge, Massachusetts. Chair of the Local Organizing Com-Mittee is Sy Friedman.• The 1997 ASL European Summer Meeting (Logic Colloquium'97) Will Be Held in Early. [REVIEW]J. Derrick, F. Drake, D. Macpherson, A. Slomson, J. Truss & S. Wainer - 1995 - Bulletin of Symbolic Logic 1 (3).
  17.  5
    2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05.Stan S. Wainer - 2006 - Bulletin of Symbolic Logic 12 (2):310-361.
  18.  5
    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  
     
    Bookmark  
  19.  4
    Inductive Definitions Over a Predicative Arithmetic.Stanley S. Wainer & Richard S. Williams - 2005 - Annals of Pure and Applied Logic 136 (1-2):175-188.
    Girard’s maxim, that Peano Arithmetic is a theory of one inductive definition, is re-examined in the light of a weak theory EA formalising basic principles of Nelson’s predicative Arithmetic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20.  4
    358 PG. Hinman.J. Barwise, L. Blum, M. Shub, S. Smale, Fr Drake, Ss Wainer, E. Engeler, Hm Friedman, Ro Gandy & Cme Yates - 1999 - In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier. pp. 358.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  21.  2
    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.
  22.  1
    Editorial Logic Colloquium 95, Haifa, Israel Invited Papers on Proof Theory.Gerhard Jaeger, Wolfram Pohlers & Stan Wainer - 1997 - Archive for Mathematical Logic 5.
    Direct download  
     
    Export citation  
     
    Bookmark  
  23.  23
    Proof Theory: A Selection of Papers From the Leeds Proof Theory Programme, 1990.Peter Aczel, Harold Simmons & S. S. Wainer (eds.) - 1992 - 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  
     
    Export citation  
     
    Bookmark  
  24. 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.
  25.  24
    Computability, Enumerability, Unsolvability: Directions in Recursion Theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - 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  
     
    Bookmark  
  26. The 1996-97 ASL Winter Meeting Will Be Held in Conjunction with the Annual Meeting of the American Mathematical Society During January 8-11, 1997, in San Diego, California. The 1996-97 ASL Annual Meeting Will Be Held March 22-25, 1997, at the Massachusetts Institute of Technology in Cambridge, Massachusetts. Chair of the Local Organizing Com-Mittee is Sy Friedman. [REVIEW]A. Louveau, Y. Moschovakis, L. Pacholski, H. Schwichtenberg, T. Slaman, J. Truss, H. D. Macpherson, A. Slomson & S. Wainer - 1996 - Bulletin of Symbolic Logic 2:121.