Reuben Goodstein

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Reuben Goodstein
Born (1912-12-15)15 December 1912
London
Died 8 March 1985(1985-03-08) (aged 72)
Leicester
Institutions University of Leicester
University of Cambridge
Alma mater Birkbeck, University of London
Thesis An axiom-free equation calculus (1946)
Doctoral advisor Ludwig Wittgenstein[1]
Doctoral students Alan Bundy
S. Barry Cooper
Raymond Cuninghame-Green
Martin Löb
Paul Stanford
H. P. (Paul) Williams[1]
Known for Goodstein's theorem
Primitive recursive arithmetic

Reuben Louis Goodstein (15 December 1912 – 8 March 1985) was an English mathematician with a strong interest in the philosophy and teaching of mathematics.[2]

Education[edit]

Goodstein was educated at St Paul's School in London. He received his Master's degree from the University of Cambridge. After this, he worked at the University of Reading but ultimately spent most of his academic career in the University of Leicester. He earned his PhD from the University of London in 1946[3] while still working in Reading. Goodstein also studied under Ludwig Wittgenstein and John Littlewood.

Research[edit]

He published many works on finitism and the reconstruction of analysis from a finitistic viewpoint, for example "Constructive Formalism. Essays on the foundations of mathematics." Goodstein's theorem was among the earliest examples of theorems found to be unprovable in Peano arithmetic but provable in stronger logical systems (such as second order arithmetic). He also introduced a variant of the Ackermann function that is now known as the hyperoperation sequence, together with the naming convention now used for these operations (tetration, pentation, etc.).

Besides mathematical logic (in which he held the first professorial chair in the U.K.), mathematical analysis, and the philosophy of mathematics, Goodstein was keenly interested in the teaching of mathematics. From 1956 to 1962 he was editor of the Mathematical Gazette. In 1962 he was an invited speaker (with an address on A recursive lattice) at the International Congress of Mathematicians in Stockholm. Among his doctoral students are Martin Löb and Alan Bundy.[1]

Publications[edit]

  • Fundamental concepts of mathematics, Pergamon Press, 1962, 2nd edn. 1979
  • Essays in the philosophy of mathematics, Leicester University Press 1965
  • Recursive Analysis, North Holland 1961, Dover 2010
  • Mathematical Logic, Leicester University Press 1957[4]
  • Development of mathematical logic, London, Logos Press 1971
  • Complex functions, McGraw Hill 1965
  • Boolean Algebra, Pergamon Press 1963, Dover 2007
  • Recursive number theory - a development of recursive arithmetic in a logic-free equation calculus, North Holland 1957
  • Constructive formalism - essays on the foundations of mathematics, Leicester University College 1951
  • with E. J. F. Primrose: Axiomatic projective geometry, Leicester University College 1953

References[edit]

  1. ^ a b c Reuben Goodstein at the Mathematics Genealogy Project
  2. ^ O'Connor, John J.; Robertson, Edmund F., "Reuben Goodstein", MacTutor History of Mathematics archive, University of St Andrews .
  3. ^ Goodstein, R. L. (1945). "Function Theory in an Axiom-Free Equation Calculus". Proceedings of the London Mathematical Society: 401–434. doi:10.1112/plms/s2-48.1.401.  edit
  4. ^ Rogers, Hartley (1958). "Review: R. L. Goodstein, Mathematical logic". Bull. Amer. Math. Soc. 64 (1): 32–35. doi:10.1090/s0002-9904-1958-10141-x.