Joel David Hamkins
Joel David Hamkins
|Alma mater||University of California, Berkeley|
California Institute of Technology
|Institutions||University of Oxford|
|Doctoral advisor||W. Hugh Woodin|
Joel David Hamkins is an American mathematician and philosopher based at the University of Oxford. He has made contributions in mathematical and philosophical logic, particularly set theory and the philosophy of set theory, in computability theory, and in group theory.
After earning a B.S. in mathematics at the California Institute of Technology, Hamkins earned his Ph.D. in mathematics in 1994 at the University of California, Berkeley under the supervision of W. Hugh Woodin, with a dissertation entitled Lifting and Extending Measures by Forcing; Fragile Measurability. He joined the faculty of the City University of New York in 1995, where he was a member of the doctoral faculties in Mathematics, in Philosophy and in Computer Science at the CUNY Graduate Center and professor of mathematics at the College of Staten Island. He has also held various faculty or visiting fellow positions at University of California at Berkeley, Kobe University, Carnegie Mellon University, University of Muenster, Georgia State University, University of Amsterdam, the Fields Institute, New York University and the Isaac Newton Institute.
Hamkins research work is cited, and he gives talks, including events for the general public. Hamkins was interviewed on his research by Richard Marshall in 2013 for 3:AM Magazine, as part of an ongoing interview series for that magazine of prominent philosophers and public intellectuals, and he is occasionally interviewed by the popular science media about issues in the philosophy of mathematics.
In set theory, Hamkins has investigated the indestructibility phenomenon of large cardinals, proving that small forcing necessarily ruins the indestructibility of supercompact and other large cardinals and introducing the lottery preparation as a general method of forcing indestructibility. Hamkins introduced the modal logic of forcing and proved with Benedikt Löwe that if ZFC is consistent, then the ZFC-provably valid principles of forcing are exactly those in the modal theory known as S4.2. Hamkins, Linetsky and Reitz proved that every countable model of Gödel-Bernays set theory has a class forcing extension to a pointwise definable model, in which every set and class is definable without parameters. Hamkins and Reitz introduced the ground axiom, which asserts that the set-theoretic universe is not a forcing extension of any inner model by set forcing. Hamkins proved that any two countable models of set theory are comparable by embeddability, and in particular that every countable model of set theory embeds into its own constructible universe.
Philosophy of set theory
In his philosophical work, Hamkins has defended a multiverse perspective of mathematical truth, arguing that diverse concepts of set give rise to different set-theoretic universes with different theories of mathematical truth. He argues that the Continuum Hypothesis question, for example, "is settled on the multiverse view by our extensive knowledge about how it behaves in the multiverse, and as a result it can no longer be settled in the manner formerly hoped for." (Hamkins 2012) Elliott Mendelson writes of Hamkins's work on the set-theoretic multiverse that, "the resulting study is an array of new fantastic, and sometimes bewildering, concepts and results that already have yielded a flowering of what amounts to a new branch of set theory. This ground-breaking paper gives us a glimpse of the amazingly fecund developments spearheaded by the author and...others..."
In other computability work, Hamkins and Miasnikov proved that the classical halting problem for Turing machines, although undecidable, is nevertheless decidable on a set of asymptotic probability one, one of several results in generic-case complexity showing that a difficult or unsolvable problem can be easy on average.
In group theory, Hamkins proved that every group has a terminating transfinite automorphism tower. With Simon Thomas, he proved that the height of the automorphism tower of a group can be modified by forcing.
On the topic of infinite chess, Hamkins, Brumleve and Schlicht proved that the mate-in-n problem of infinite chess is decidable. Hamkins and Evans investigated transfinite game values in infinite chess, proving that every countable ordinal arises as the game value of a position in infinite three-dimensional chess.
Hamkins is the top-rated user by reputation score on MathOverflow. Gil Kalai describes him as "one of those distinguished mathematicians whose arrays of MO answers in their areas of interest draw coherent deep pictures for these areas that you probably cannot find anywhere else."
- Hamkins, Joel David (May 17, 2018). "Oxford University, Professor of Logic & Sir Peter Strawson Fellow, University College Oxford".
- J. D. Hamkins: Google Scholar profile.
- List of talks, from Hamkins's web page.
- The Span of Infinity, Helix Center roundtable, October 25, 2014. (Hamkins was a panelist.)
- J. D. Hamkins, plenary General Public Lecture, Higher infinity and the Foundations of Mathematics, American Association for the Advancement of Science, Pacific Division, June, 2014.
- A Meeting at the Crossroads - Science, Performance and the Art of Possibility, The Intrinsic Value Project, Underground Zero, New York City, July 9 & 10, 2014. (Hamkins was a panelist.)
- The Future of Infinity: Solving Math's Most Notorious Problem, World Science Festival, New York City, June 1, 2013. (Hamkins was a panelist.)
- Richard Marshall, Playing Infinite Chess, 3AM Magazine, March 25, 2013.
- Jacob Aron, Mathematicians Think Like Machines for Perfect Proofs New Scientist, 26 June 2013.
- Erica Klarreich, Infinite Wisdom, Science News, Volume 164, No. 9, August 30, 2003, p. 139.
- David Hamkins, Joel (1998). "Small Forcing Makes any Cardinal Superdestructible". The Journal of Symbolic Logic. 63 (1): 51–58. arXiv:1607.00684. doi:10.2307/2586586.
- David Hamkins, Joel (2000). "The Lottery Preparation". Annals of Pure and Applied Logic. 101 (2–3): 103–146. doi:10.1016/S0168-0072(99)00010-X.
- David Hamkins, Joel; Löwe, Benedikt (2008). "The modal logic of forcing". Transactions of the American Mathematical Society. 360 (4): 1793–1817. arXiv:math/0509616. doi:10.1090/s0002-9947-07-04297-3.
- David Hamkins, Joel (2013). "David Linetsky and Jonas Reitz, Pointwise definable models of set theory". The Journal of Symbolic Logic. 78 (1): 139–156. arXiv:1105.4597. doi:10.2178/jsl.7801090.
- David Hamkins, Joel (2013). "Every countable model of set theory embeds into its own constructible universe". J. Math. Log. 13 (2): 1350006. arXiv:1207.0963. doi:10.1142/S0219061313500062.
- "The set-theoretic multiverse". The Review of Symbolic Logic. 5 (03): 416–449. 2012. doi:10.1017/S1755020311000359.
- J. D. Hamkins, The multiverse perspective on determinateness in set theory, talk at the Exploring the Frontiers of Incompleteness, Harvard University, October 19, 2011. video
- Elliott Mendelson, Zentralblatt review of J. D. Hamkins, The set-theoretic multiverse, Review of Symbolic Logic, 5, No. 3, 416-449 (2012), Zbl 1260.03103.
- David Hamkins, Joel; Lewis, Andy (2000). "Infinite-time Turing machines". The Journal of Symbolic Logic. 65 (02): 567–604. doi:10.2307/2586556.
- David Hamkins, Joel; Miasnikov, Alexei (2006). "The Halting Problem Is Decidable on a Set of Asymptotic Probability One". Notre Dame J. Formal Logic. 47 (4): 515–524. doi:10.1305/ndjfl/1168352664.
- "Every group has a terminating automorphism tower". Proceedings of the American Mathematical Society. 126 (11): 3223–3226. 1998. doi:10.1090/s0002-9939-98-04797-2.
- Brumleve, Dan; David Hamkins, Joel; Schlicht, Philipp (2012). "The mate-in-n problem of infinite chess is decidable, in How the World Computes". Lecture Notes in Computer Science. 7318: 78–88. doi:10.1007/978-3-642-30870-3_9.
- C. D. A. Evans and J. D. Hamkins, "Transfinite game values in infinite chess," Integers, volume 14, Paper No. G2, 36, 2014.
- MathOverflow users, by reputation score.
- MathOverflow announcement of Hamkins breaking 100,000 reputation score, September 17, 2014.
- MathOverflow announcement of Hamkins posting 1000th answer, January 30, 2014.
- Erica Klarreich, The Global Math Commons, Simons Foundation Science News, May 18, 2011.
- Gil Kalai on Hamkins's MathOverflow achievements, January 29, 2014.