Stanley S. Wainer

According to our database, Stanley S. Wainer authored at least 23 papers between 1972 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Goodstein sequences based on a Parametrized Ackermann-Péter function.

Toshiyasu Arai, Stanley S. Wainer, Andreas Weiermann

Bull. Symb. Log., 2021

2018

S. Barry Cooper (1943-2015).

Richard Elwes, Andy Lewis-Pye, Benedikt Löwe, Dugald Macpherson, Dag Normann, Andrea Sorbi, Alexandra A. Soskova, Mariya Ivanova Soskova, Peter van Emde Boas, Stanley S. Wainer

Comput., 2018

2013

Guest Editorial.

Jan A. Bergstra, Jens Blanck, Faron Moller, Stanley S. Wainer

Comput. J., 2013

2012

Proofs and Computations.

Helmut Schwichtenberg, Stanley S. Wainer

Perspectives in logic, Association for Symbolic Logic, ISBN: 978-0-521-51769-0, 2012

2005

Inductive definitions over a predicative arithmetic.

Stanley S. Wainer, Richard S. Williams

Ann. Pure Appl. Log., 2005

Elementary arithmetic.

Geoffrey E. Ostrin, Stanley S. Wainer

Ann. Pure Appl. Log., 2005

Complexity in Predicative Arithmetic.

Geoffrey E. Ostrin, Stanley S. Wainer

Proceedings of the New Computational Paradigms, 2005

1999

Accessible recursive functions.

Stanley S. Wainer

Bull. Symb. Log., 1999

1998

Editorial Logic Colloquium '95, Haifa, Israel.

Gerhard Jäger, Wolfram Pohlers, Stanley S. Wainer

Arch. Math. Log., 1998

1995

Accessible Segments of the Fast Growing Hierarchy.

Stanley S. Wainer

Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

1994

Equational Derivation vs. Computation.

W. G. Handley, Stanley S. Wainer

Ann. Pure Appl. Log., 1994

The Hierarchy of terminating Recursive Programs over N.

Stanley S. Wainer

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

1993

Program Transformation and Proof Transformation.

Wilfried Sieg, Stanley S. Wainer

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992

Ordinal Complexity of Recursive Definitions

M. V. H. Fairtlough, Stanley S. Wainer

Inf. Comput., August, 1992

1990

Provable Computable Functions on Abstract Data Types.

John V. Tucker, Stanley S. Wainer, Jeffery I. Zucker

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

Slow Growing Versus Fast Growing.

Stanley S. Wainer

J. Symb. Log., 1989

1988

A plus-1 theorem for sub-sections.

Stanley S. Wainer

Arch. Math. Log., 1988

1986

Members of countable π₁⁰ classes.

Douglas A. Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare, Stanley S. Wainer

Ann. Pure Appl. Log., 1986

1983

The Slow-Growing and the Grzecorczyk Hierarchies.

E. A. Cichon, Stanley S. Wainer

J. Symb. Log., 1983

1981

European Summer Meeting of the Association for Symbolic Logic: Leeds, 1979.

F. R. Drake, Stanley S. Wainer

J. Symb. Log., 1981

1980

The 1-Section of a Countable Functional.

Dag Normann, Stanley S. Wainer

J. Symb. Log., 1980

1974

A Hierarchy for the 1-Section of Any Type Two Object.

Stanley S. Wainer

J. Symb. Log., 1974

1972

Ordinal Recursion, and a Refinement of the Extended Grzegorczyk Hierarchy.

Stanley S. Wainer

J. Symb. Log., 1972