Wilhelm Ackermann

related topics
{math, number, function}
{work, book, publish}
{area, part, region}

Wilhelm Friedrich Ackermann (29 March 1896, Herscheid municipality, Germany – 24 December 1962 Lüdenscheid, Germany) was a German mathematician best known for the Ackermann function, an important example in the theory of computation.

Ackermann was awarded the Ph.D. by the University of Göttingen in 1925 for his thesis Begründung des "tertium non datur" mittels der Hilbertschen Theorie der Widerspruchsfreiheit, which was a consistency proof of arithmetic apparently without full Peano induction (although it did use e.g. induction over the length of proofs). From 1929 until 1948, he taught at the Arnoldinum Gymnasium in Burgsteinfurt, and then at Lüdenscheid until 1961. He was also a corresponding member of the Akademie der Wissenschaften (Academy of Sciences) in Göttingen, and was an honorary professor at the University of Münster.

In 1928, Ackermann helped David Hilbert turn his 1917-22 lectures on introductory mathematical logic into a text, Principles of Mathematical Logic. This text contained the first exposition ever of first-order logic, and posed the problem of its completeness and decidability (Entscheidungsproblem). Ackermann went on to construct consistency proofs for set theory (1937), full arithmetic (1940), type-free logic (1952), and a new axiomatization of set theory (1956).

Although Ackermann did not choose a university career and rather continued as a high school teacher, he was continually engaged in research and published many contributions to the foundations of mathematics until the end of his life.

See also

Bibliography

External links

Full article ▸

related documents
Vladimir Voevodsky
Gauss–Markov process
SISAL
Super-Poulet number
Cypherpunk anonymous remailer
Inductive logic programming
Mathematical constants (sorted by continued fraction representation)
Tomaž Pisanski
Classical logic
Euler's sum of powers conjecture
Liouville function
Code word
FIPS county code
Unavailability
Structure and Interpretation of Computer Programs
National Center for Biotechnology Information
Ninety-ninety rule
Quick-and-dirty
Unix billennium
Type 1 encryption
Mrs. Miniver's problem
Facade pattern
August Ferdinand Möbius
Hill system
Object-oriented programming language
Shotgun debugging
Wikipedia:Free On-line Dictionary of Computing/X - Z
Spaced repetition
International Air Transport Association airport code
Semivariance