Joel David Hamkins

Last updated
Joel David Hamkins
Joel Hamkins, July 1994 (headshot).jpg
NationalityAmerican
Alma mater University of California, Berkeley
California Institute of Technology
Scientific career
Fields Mathematics, Philosophy
Institutions University of Notre Dame
University of Oxford
City University of New York
Doctoral advisor W. Hugh Woodin
Notable students José R. Ramírez-Garofalo

Joel David Hamkins is an American mathematician and philosopher who is the John Cardinal O'Hara Professor of Logic at the University of Notre Dame. [1] He has made contributions in mathematical and philosophical logic, set theory and philosophy of set theory (particularly the idea of the set-theoretic multiverse), in computability theory, and in group theory.

Contents

Biography

After earning a Bachelor of Science 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 Münster, Georgia State University, University of Amsterdam, the Fields Institute, New York University and the Isaac Newton Institute. [2]

In September 2018, Hamkins moved to the University of Oxford to become Professor of Logic in the Faculty of Philosophy and Sir Peter Strawson Fellow in Philosophy in University College, Oxford. [3] In January 2022 he moved to the University of Notre Dame [4] as the John Cardinal O'Hara Professor of Logic.

Research contributions

Hamkins research work is cited, [5] and he gives talks, [6] including events for the general public. [7] [8] [9] [10] 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, [11] and he is occasionally interviewed by the popular science media about issues in the philosophy of mathematics. [12] [13]

Set theory

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 [14] and introducing the lottery preparation as a general method of forcing indestructibility. [15] 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. [16] 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. [17] 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. [18]

Philosophy of set theory

In his philosophical work, Hamkins has defended a multiverse perspective of mathematical truth, [19] [20] 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..." [21]

Potentialism

Hamkins has investigated a model-theoretic account of the philosophy of potentialism. In joint work with Øystein Linnebo, he introduced several varieties of set-theoretic potentialism. [22] He gave a similar analysis for potentialist concepts in arithmetic, treating the models of PA under a variety of natural extension concepts, using especially the universal algorithm of W. Hugh Woodin. In further joint work, Hamkins and Woodin provided a set-theoretic generalization of that result. Hamkins mounted a general account of modal model theory in joint work with his Oxford DPhil student Wojciech Aleksander Wołoszyn. [23]

Infinitary computability

Hamkins introduced with Jeff Kidder and Andy Lewis the theory of infinite-time Turing machines, a part of the subject of hypercomputation, with connections to descriptive set theory. [24]

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. [25]

Group theory

In group theory, Hamkins proved that every group has a terminating transfinite automorphism tower. [26] With Simon Thomas, he proved that the height of the automorphism tower of a group can be modified by forcing.

Infinite games

Hamkins has investigated several infinitary games, including infinite chess, infinite draughts, infinite Hex, and others. On the topic of infinite chess, Hamkins, Brumleve and Schlicht proved that the mate-in-n problem of infinite chess is decidable. [27] 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. [28] Hamkins and Davide Leonessi proved that every countable ordinal arises as a game value in infinite draughts. [29] They also proved that infinite Hex is a draw. [30]

Juggling theory

As an undergraduate at Caltech in the 1980s, Hamkins made contributions to the mathematical theory of juggling, working with Bruce Tiemann to develop what became known as the siteswap juggling notation.

MathOverflow

Hamkins is the top-rated [31] user by reputation score on MathOverflow. [32] [33] [34] 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." [35]


Related Research Articles

In mathematics, specifically set theory, the continuum hypothesis is a hypothesis about the possible sizes of infinite sets. It states:

"There is no set whose cardinality is strictly between that of the integers and the real numbers."

Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics.

<span class="mw-page-title-main">Integer sequence</span> Ordered list of whole numbers

In mathematics, an integer sequence is a sequence of integers.

Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. Its defining method can briefly be described as "going backwards from the theorems to the axioms", in contrast to the ordinary mathematical practice of deriving theorems from axioms. It can be conceptualized as sculpting out necessary conditions from sufficient ones.

In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large". The proposition that such cardinals exist cannot be proved in the most common axiomatization of set theory, namely ZFC, and such propositions can be viewed as ways of measuring how "much", beyond ZFC, one needs to assume to be able to prove certain desired results. In other words, they can be seen, in Dana Scott's phrase, as quantifying the fact "that if you want more you have to assume more".

In mathematics, the axiom of dependent choice, denoted by , is a weak form of the axiom of choice that is still sufficient to develop much of real analysis. It was introduced by Paul Bernays in a 1942 article in reverse mathematics that explores which set-theoretic axioms are needed to develop analysis.

In mathematics, an unfoldable cardinal is a certain kind of large cardinal number.

In mathematics and computer science, Zeno machines are a hypothetical computational model related to Turing machines that are capable of carrying out computations involving a countably infinite number of algorithmic steps. These machines are ruled out in most models of computation.

Determinacy is a subfield of set theory, a branch of mathematics, that examines the conditions under which one or the other player of a game has a winning strategy, and the consequences of the existence of such strategies. Alternatively and similarly, "determinacy" is the property of a game whereby such a strategy exists. Determinacy was introduced by Gale and Stewart in 1950, under the name "determinateness".

In set theory, a branch of mathematics, a reflection principle says that it is possible to find sets that, with respect to any given property, resemble the class of all sets. There are several different forms of the reflection principle depending on exactly what is meant by "resemble". Weak forms of the reflection principle are theorems of ZF set theory due to Montague (1961), while stronger forms can be new and very powerful axioms for set theory.

In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations. However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not ; various more-concrete ways of defining ordinals that definitely have notations are available.

<span class="mw-page-title-main">Rado graph</span> Infinite graph containing all countable graphs

In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed by choosing independently at random for each pair of its vertices whether to connect the vertices by an edge. The names of this graph honor Richard Rado, Paul Erdős, and Alfréd Rényi, mathematicians who studied it in the early 1960s; it appears even earlier in the work of Wilhelm Ackermann. The Rado graph can also be constructed non-randomly, by symmetrizing the membership relation of the hereditarily finite sets, by applying the BIT predicate to the binary representations of the natural numbers, or as an infinite Paley graph that has edges connecting pairs of prime numbers congruent to 1 mod 4 that are quadratic residues modulo each other.

In proof theory, ordinal analysis assigns ordinals to mathematical theories as a measure of their strength. If theories have the same proof-theoretic ordinal they are often equiconsistent, and if one theory has a larger proof-theoretic ordinal than another it can often prove the consistency of the second theory.

A timeline of mathematical logic; see also history of logic.

<span class="mw-page-title-main">Infinity</span> Mathematical concept

Infinity is something which is boundless, endless, or larger than any natural number. It is often denoted by the infinity symbol .

<span class="mw-page-title-main">Akihiro Kanamori</span> Japanese-born American mathematician

Akihiro Kanamori is a Japanese-born American mathematician who won the Abel Prize. He specializes in set theory and is the author of the monograph on large cardinals, The Higher Infinite. He has written several essays on the history of mathematics, especially set theory.

In set theory, the ground axiom states that the universe of set theory is not a nontrivial set-forcing extension of an inner model. The axiom was introduced by Hamkins (2005) and Reitz (2007).

In mathematical set theory, a worldly cardinal is a cardinal κ such that the rank Vκ is a model of Zermelo–Fraenkel set theory.

In mathematical set theory, the multiverse view is that there are many models of set theory, but no "absolute", "canonical" or "true" model. The various models are all equally valid or true, though some may be more useful or attractive than others. The opposite view is the "universe" view of set theory in which all sets are contained in some single ultimate model.

<span class="mw-page-title-main">Infinite chess</span> Variation of chess

Infinite chess is any variation of the game of chess played on an unbounded chessboard. Versions of infinite chess have been introduced independently by multiple players, chess theorists, and mathematicians, both as a playable game and as a model for theoretical study. It has been found that even though the board is unbounded, there are ways in which a player can win the game in a finite number of moves.

References

  1. ↑ "Joel David Hamkins". University of Notre Dame . Retrieved 2022-01-05.
  2. ↑ "Curriculum Vita" (PDF). Retrieved 5 February 2020.
  3. ↑ Hamkins, Joel David (May 17, 2018). "Oxford University, Professor of Logic & Sir Peter Strawson Fellow, University College Oxford".
  4. ↑ "Notre Dame Hires Hamkins from Oxford and Montero from CUNY". 23 September 2021.
  5. ↑ J. D. Hamkins: Google Scholar profile.
  6. ↑ List of talks, from Hamkins's web page.
  7. ↑ The Span of Infinity, Helix Center roundtable, October 25, 2014. (Hamkins was a panelist.)
  8. ↑ 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.
  9. ↑ 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.)
  10. ↑ The Future of Infinity: Solving Math's Most Notorious Problem, World Science Festival, New York City, June 1, 2013. (Hamkins was a panelist.)
  11. ↑ Richard Marshall, Playing Infinite Chess, 3AM Magazine, March 25, 2013.
  12. ↑ Jacob Aron, Mathematicians Think Like Machines for Perfect Proofs New Scientist, 26 June 2013.
  13. ↑ Erica Klarreich, Infinite Wisdom, Science News, Volume 164, Number 9, August 30, 2003, page 139.
  14. ↑ Hamkins, Joel David (1998). "Small Forcing Makes any Cardinal Superdestructible". The Journal of Symbolic Logic. 63 (1): 51–58. arXiv: 1607.00684 . doi:10.2307/2586586. JSTOR   2586586. S2CID   40252670.
  15. ↑ Hamkins, Joel David (2000). "The Lottery Preparation". Annals of Pure and Applied Logic. 101 (2–3): 103–146. doi:10.1016/S0168-0072(99)00010-X. S2CID   15579965.
  16. ↑ Hamkins, Joel David; 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. S2CID   14724471.
  17. ↑ Hamkins, Joel David (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. S2CID   43689192.
  18. ↑ Hamkins, Joel David (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. S2CID   18836919.
  19. ↑ Hamkins, Joel David (2012). "The set-theoretic multiverse". The Review of Symbolic Logic. 5 (3): 416–449. arXiv: 1108.4223 . doi:10.1017/S1755020311000359. S2CID   33807508.
  20. ↑ 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
  21. ↑ Elliott Mendelson, Zentralblatt review of J. D. Hamkins, The set-theoretic multiverse, Review of Symbolic Logic, 5, Number 3, pages 416-449 (2012), Zbl   1260.03103.
  22. ↑ Hamkins, Joel David; Linnebo, Øystein (2022). "THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES". The Review of Symbolic Logic. 15 (1): 1–35. arXiv: 1708.01644 . doi:10.1017/S1755020318000242.
  23. ↑ Hamkins, Joel David; Wołoszyn, Wojciech Aleksander (2022). "Modal model theory". Notre Dame Journal of Formal Logic. 65 (1): 1–37. arXiv: 2009.09394 . doi:10.1215/00294527-2024-0001.
  24. ↑ Hamkins, Joel David; Lewis, Andy (2000). "Infinite-time Turing machines". The Journal of Symbolic Logic. 65 (2): 567–604. arXiv: math/9808093 . doi:10.2307/2586556. JSTOR   2586556. S2CID   125601911.
  25. ↑ Hamkins, Joel David; Miasnikov, Alexei (2006). "The Halting Problem Is Decidable on a Set of Asymptotic Probability One". Notre Dame J. Formal Logic. 47 (4): 515–524. arXiv: math/0504351 . doi:10.1305/ndjfl/1168352664. S2CID   15005164.
  26. ↑ Hamkins, Joel David (1998). "Every group has a terminating automorphism tower". Proceedings of the American Mathematical Society. 126 (11): 3223–3226. doi: 10.1090/s0002-9939-98-04797-2 .
  27. ↑ Brumleve, Dan; Hamkins, Joel David; Schlicht, Philipp (2012). "The mate-in-n problem of infinite chess is decidable". In Cooper, S. Barry; Dawar, Anuj; Löwe, Benedikt (eds.). How the World Computes – Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, United Kingdom, June 18–23, 2012. Proceedings. Lecture Notes in Computer Science. Vol. 7318. Springer. pp. 78–88. arXiv: 1201.5597 . doi:10.1007/978-3-642-30870-3_9.
  28. ↑ C. D. A. Evans and J. D. Hamkins, "Transfinite game values in infinite chess," Integers, volume 14, Paper Number G2, 36, 2014.
  29. ↑ Joel David Hamkins and Davide Leonessi. "Transfinite game values in infinite draughts," Integers, volume 22, Paper Number G5, 2022. http://math.colgate.edu/~integers/wg5/wg5.pdf. arXiv:2111.02053
  30. ↑ Joel David Hamkins and Davide Leonessi. "Infinite Hex is a draw," Integers, volume 23, paper G6, http://math.colgate.edu/~integers/xg6/xg6.pdf, doi: 10.5281/zenodo.10075843, arXiv:2201.06475.
  31. ↑ MathOverflow users, by reputation score.
  32. ↑ MathOverflow announcement of Hamkins breaking 100,000 reputation score, September 17, 2014.
  33. ↑ MathOverflow announcement of Hamkins posting 1000th answer, January 30, 2014.
  34. ↑ Erica Klarreich, The Global Math Commons, Simons Foundation Science News, May 18, 2011.
  35. ↑ Gil Kalai on Hamkins's MathOverflow achievements, January 29, 2014.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.