Stephen Cole Kleene

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Stephen Cole Kleene" – news · newspapers · books · scholar · JSTOR (September 2022) (Learn how and when to remove this template message)

Stephen Kleene
Born	(1909-01-05)January 5, 1909 Hartford, Connecticut, U.S.
Died	January 25, 1994(1994-01-25) (aged 85) Madison, Wisconsin, U.S.
Nationality	American
Alma mater	Amherst College Princeton University
Known for	Contributions to intuitionism Kleene–Mostowski hierarchy Kleene–Rosser paradox Kleene star Kleene's algorithm Kleene's theorem Realizability Regular expressions Kleene's smn theorem
Awards	Yiannis Moschovakis Nels David Nelson Dick de Jongh

Stephen Cole Kleene (

.

Biography

Kleene was awarded a bachelor's degree from Amherst College in 1930. He was awarded a Ph.D. in mathematics from Princeton University in 1934, where 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

, 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

In 1946, Kleene returned to the University of Wisconsin-Madison, becoming a full professor in 1948 and the Cyrus C. MacDuffee professor of mathematics in 1964. He served two terms as the Chair of the Department of Mathematics and one term as the Chair of the Department of Numerical Analysis (later renamed the Department of Computer Science). He also served as Dean of the College of Letters and Science in 1969–1974. During his years at the University of Wisconsin he was thesis advisor to 13 Ph.D. students. He retired from the University of Wisconsin in 1979. In 1999 the mathematics library at the University of Wisconsin was renamed in his honor.[3]

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 intuitionistic logic and mathematical intuitionism.

[...] recursive function theory is of central importance in computer science. Kleene is responsible for many of the fundamental results in the area, including the Kleene normal form theorem (1936), the Kleene recursive theorem (1938), the development of the arithmetical and hyper-arithmetical hierarchies in the 1940s and 1950s, the Kleene-Post theory of degrees of unsolvability (1954), and higher-type recursion theory. which he began in the late 1950s and returned to in the late 1970s. [...] Beginning in the late 1940s, Kleene also worked in a second area, Brouwer's intuitionism. Using tools from recursion theory, he introduced recursive realizability, an important technique for interpreting intuitionistic statements. In the summer of 1951 at the

Rand Corporation, he produced a major breakthrough in a third area when he gave an important characterization of events accepted by a finite automaton.^[4]

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

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

causes.

Legacy

At each conference of the Symposium on Logic in Computer Science the Kleene Award, in honour of Stephen Cole Kleene, is given for the best student paper.^[7]

Selected publications

• 1935. "A Theory of Positive Integers in Formal Logic. Part I".
  JSTOR 2372027
  .
• 1935. "A Theory of Positive Integers in Formal Logic. Part II". American Journal of Mathematics. 57 (2): 219–244. Apr 1935.
  JSTOR 2371199
  .
• 1935. —;
  JSTOR 1968646
  .
• 1936. "General recursive functions of natural numbers". Mathematische Annalen (112): 727–742. 1936.
• 1936. "${\displaystyle \lambda }$-definability and recursiveness". Duke Mathematical Journal. 2 (2): 340–352. 1936.
• 1938. "On Notations for Ordinal Numbers" (PDF). Journal of Symbolic Logic. 3 (4): 150–155. 1938.
  S2CID 34314018
  .
• 1943. "Recursive predicates and quantifiers". Transactions of the American Mathematical Society. 53 (1): 41–73. Jan 1943.
  doi:10.1090/S0002-9947-1943-0007371-8
  .
• 1951. "Representation of Events in Nerve Nets and Finite Automata" (PDF). U. S. Air Force Project Rand Research Memorandum. No. RM-704.
  The RAND Corporation
  . 15 December 1951.

• 1952. Introduction to Metamathematics. New York: Van Nostrand. 1952.
  OCLC 523942.^[8]

• 1956.
  OCLC 564148
  .
• 1965 —; Vesley, Richard Eugene. The Foundations of Intuitionistic Mathematics. North-Holland.[9]
• 1967. Mathematical Logic.
  ISBN 0-486-42533-9
  .
• 1981. "Origins of Recursive Function Theory" in Annals of the History of Computing 3, No. 1.
• 1987. "Reflections on Church's thesis". Notre Dame Journal of Formal Logic. 28 (4): 490–498. Oct 1987.
  doi:10.1305/ndjfl/1093637645
  .

See also

• Kleene–Brouwer order
• Kleene–Rosser paradox
• Kleene's O
• Kleene's T predicate
• List of pioneers in computer science

Notes

1. ^ Although his last name is commonly pronounced /ˈkliːni/ KLEE-nee or /kliːn/ KLEEN, Kleene himself pronounced it /ˈkleɪni/ KLAY-nee.^[1] His son, Ken Kleene, wrote: "As far as I am aware this pronunciation is incorrect in all known languages. I believe that this novel pronunciation was invented by my father."^[2] However, many instances of this surname can be found in the Netherlands and Dutch pronunciation of 'ee' is as ay as in hail, but shorter. Probably, Kleene was aware of that.

References

1. ^ Pace, Eric (January 27, 1994). "Stephen C. Kleene Is Dead at 85; Was Leader in Computer Science". The New York Times.
2. ^ In Entry "Stephen Kleene" at Free Online Dictionary of Computing.
3. ^ "S. C. Kleene". Retrieved February 8, 2021.
4. Keisler, H. Jerome
   (September 1994). "Stephen Cole Kleene 1909–1994". Notices of the AMS. 41 (7): 792.
5. ^ IUHPS website; also known as "International Union of the History and the Philosophy of Science". A member of ICSU, the International Council for Science (formerly named International Council of Scientific Unions).
6. ^ Daniel Dennett and Karel Lambert, "kleene", in The Philosophical Lexicon, 7th ed. (Newark, DE: American Philosophical Association, 1978), 5; and Hyperborea (blogger pseudonym), "Dennett's Logocentric Lexicon" (9 December 2007): http://aeconomics.blogspot.com/2007/12/dennetts-logocentric-lexicon.html
7. ^ "LICS – Archive". lics.siglog.org.
8. ISBN 9780923891572
   .
9. doi:10.1090/s0002-9904-1965-11412-4
   .

External links

• O'Connor, John J.; Robertson, Edmund F., "Stephen Cole Kleene", MacTutor History of Mathematics Archive, University of St Andrews
• Biographical memoir – by Saunders Mac Lane
• Kleene bibliography
• "The Princeton Mathematics Community in the 1930s: Transcript Number 23 (PMC23): Stephen C. Kleene and J. Barkley Rosser". Archived from the original on 10 March 2015. – Interview with Kleene and
  John Barkley Rosser
  about their experiences at Princeton
• Stephen Cole Kleene at DBLP Bibliography Server