#533 Overall Influence

American mathematician and theoretical computer scientist

Stephen Cole Kleene was an American mathematician. One of the students of Alonzo Church, Kleene, along with Rózsa Péter, Alan Turing, Emil Post, and others, is best known as a founder of the branch of mathematical logic known as recursion theory, which subsequently helped to provide the foundations of theoretical computer science. Kleene's work grounds the study of computable functions. A number of mathematical concepts are named after him: Kleene hierarchy, Kleene algebra, the Kleene star , Kleene's recursion theorem and the Kleene fixed-point theorem. He also invented regular expressions in 1951 to describe McCulloch-Pitts neural networks, and made significant contributions to the foundations of mathematical intuitionism.

Source: Wikipedia- Representation of Events in Nerve Nets and Finite Automata
- General recursive functions of natural numbers
- Recursive predicates and quantifiers
- The Upper Semi-Lattice of Degrees of Recursive Unsolvability
- λ-definability and recursiveness
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Hierarchies of number-theoretic predicates
- Arithmetical predicates and function quantifiers
- Origins of Recursive Function Theory
- The Inconsistency of Certain Formal Logics
- A Theory of Positive Integers in Formal Logic. Part I
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- A note on recursive functions
- The theory of recursive functions, approaching its centennial
- Reflections on Church's thesis.
- Formalized recursive functionals and formalized realizability
- Proof by Cases in Formal Logic
- Recursive Functionals and Quantifiers of Finite Types I
- A note on function quantification
- A Theory of Positive Integers in Formal Logic. Part II
- Recursive Functionals and Quantifiers of Finite Types Revisited I
- Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Two papers on the predicate calculus
- Recursive Functionals and Quantifiers of Finite Types Revisited II
- Turing-Machine Computable Functionals of Finite Types I
- Herbrand-Gödel-style recursive functionals of finite types
- Unimonotone functions of finite types (Recursive functionals and quantifiers of finite types revisited IV)
- Recursive Functionals and Quantifiers of Finite Types Revisited III
- A Note on Computable Functionals
- Analysis of Lengthening of Modulated Repetitive Pulses
- Origins of recursive function theory
- L'Antinomie de M. Godel.
- Constructive Functions in “The Foundations of Intuttionistic Mathematics”
- Chapter I A Formal System of Intuitionistic Analysis
- Recursive Functionals and Quantifiers of Finite Types II
- A Postulational Basis for Probability
- Preface
- Chapter II Various Notions of Realizability
- Chapter IV On Order in the Continuum
- Book Review: Rekursive Funktionen
- Recursive functionals and quantifiers of finite types. I
- Recursive functionals and quantifiers of finite types. II
- Recursive functionals and quantifiers of finite types revisited. V
- Recursive Functionals and Quantifiers of Finite Types Revisited, V
- A Philosophy of Mathematics.
- Mathematical Logic.
- General Recursive Functions of Natural Numbers.
- λ-Definability and Recursiveness.
- Remarks on "Unsolvable" Problems.
- Perelman versus Godel.
- Recherches sur le Systeme de la Logique Intuitioniste.
- Sur la Simplicite Formelle des Notions.
- Uber die Mehrfache Rekursion.
- On Undecidable Propositions of Formal Mathematical Systems (1934).
- The Foundations of Intuitionistic Mathematics.

University of Wisconsin–Madison

Public research university in Madison, Wisconsin, USA

Princeton University

Private Ivy League research university in Princeton, New Jersey, United States

Amherst College

Liberal arts college in Massachusetts

#44 World Rank

Computer Science

#201 World Rank

Philosophy

#202 World Rank

Mathematics

Want to be an Academic Influence Insider?

Sign up to get the latest news, information, and rankings in our upcoming newsletter.