**Stephen Cole Kleene** (/ˈkleɪni/ *KLAY-nee*;^{[1]} January 5, 1909 – January 25, 1994) 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 closure), Kleene's recursion theorem and the Kleene fixpoint theorem. He also invented regular expressions, and made significant contributions to the foundations of mathematical intuitionism.

# Biography

Kleene was awarded the BA degree from Amherst College in 1930. He was awarded the Ph.D. in mathematics from Princeton University in 1934. His thesis, entitled *A Theory of Positive Integers in Formal Logic*, was supervised by Alonzo Church. In the 1930s, he did important work on Church's lambda calculus. In 1935, he joined the mathematics department at the University of Wisconsin–Madison, where he spent nearly all of his career. After two years as an instructor, he was appointed assistant professor in 1937.

While a visiting scholar at the Institute for Advanced Study in Princeton, 1939–40, he laid the foundation for recursion theory, an area that would be his lifelong research interest. In 1941, he returned to Amherst College, where he spent one year as an associate professor of mathematics.

During World War II, Kleene was a lieutenant commander in the United States Navy. He was an instructor of navigation at the U.S. Naval Reserve's Midshipmen's School in New York, and then a project director at the Naval Research Laboratory in Washington, D.C.

In 1946, Kleene returned to Wisconsin, becoming a full professor in 1948 and the Cyrus C. MacDuffee professor of mathematics in 1964. He was chair of the Department of Mathematics and Computer Science, 1962–63, and Dean of the College of Letters and Science from 1969 to 1974. The latter appointment he took on despite the considerable student unrest of the day, stemming from the Vietnam War. He retired from the University of Wisconsin in 1979. In 1999 the mathematics library at the University of Wisconsin was renamed in his honor.^{[4]}

Kleene's teaching at Wisconsin resulted in three texts in mathematical logic, Kleene (1952, 1967) and Kleene and Vesley (1965). The first two are often cited and still in print. Kleene (1952) wrote alternative proofs to the Gödel's incompleteness theorems that enhanced their canonical status and made them easier to teach and understand. Kleene and Vesley (1965) is the classic American introduction to intuitionist logic and mathematics.

Kleene served as president of the Association for Symbolic Logic, 1956–58, and of the International Union of History and Philosophy of Science,^{[5]} 1961. In 1990, he was awarded the National Medal of Science. The importance of Kleene's work led to the saying that "Kleeneness is next to Gödelness."

Kleene and his wife Nancy Elliott had four children. He had a lifelong devotion to the family farm in Maine. An avid mountain climber, he had a strong interest in nature and the environment, and was active in many conservation causes.

# Selected publications

- 1936. « General recursive functions of natural numbers »,
*Math. Ann.*,**112**, 727–742. - 1952.
*Introduction to Metamathematics.*New York: Van Nostrand. (Ishi Press: 2009 reprint).^{[21]}^{[6]} - 1951. S. C. Kleene (15 December 1951). "Representation of Events in Nerve Nets and Finite Automata"
^{[22]}(PDF). U. S. Air Force Project Rand Research Memorandum (RM-704). The RAND Corporation. - 1956. S.C. Kleene (1956). Shannon, Claude; McCarthy, John (eds.).
*Representation of Events in Nerve Nets and Finite Automata*.*Automata Studies*. OCLC 564148^{[23]}.

- 1965 (with Richard Eugene Vesley).
*The Foundations of Intuitionistic Mathematics*. North-Holland.^{[7]}

- 1967.
*Mathematical Logic.*John Wiley. Dover reprint, 2002. ISBN 0-486-42533-9.^{[24]} - 1981. "Origins of Recursive Function Theory" in
*Annals of the History of Computing 3,*No. 1.^{[25]}

# Kleene award

At each conference of the Symposium on Logic in Computer Science the Kleene award, in honour of S.C. Kleene, is given for the best student paper.^{[8]}