Mathematician:Alonzo Church

From ProofWiki
Jump to: navigation, search


American mathematician who pioneered in the field of computability theory and the foundations of computer science.

Best known for his lambda calculus, Church's Theorem and Church's Thesis.




  • Born: June 14, 1903
  • Died: August 11, 1995

Theorems and Definitions

Results named for Alonzo Church can be found here.

Definitions of concepts named for Alonzo Church can be found here.


  • 1925: On irredundant sets of postulates
  • 1926: On the form of differential equations of a system of paths
  • 1927: Alternatives to Zermelo's assumption (his Ph.D. dissertation)
  • 1932: A set of Postulates for the Foundation of Logic (Ann. Math. Vol. 32no. 33: 346 – 366)
  • 1940: On the concept of a random sequence
  • 1940: A formulation of the simple theory of types
  • 1941: The Calculi of Lambda-Conversion
  • 1944: Introduction to Mathematical Logic
  • 1951: A formulation of the logic of sense and denotation
  • 1956: Introduction to Mathematical Logic (expanded edition)
  • 1965: Remarks on the elementary theory of differential equations as area of research
  • 1966: A generalization of Laplace's transformation
  • 1971: Set theory with a universal set (a variant of ZF-type axiomatic set theory)
  • 1976: Comparison of Russell's resolution of the semantical antinomies with that of Tarski