Joel David Hamkins

Joel David Hamkins is an American mathematician and philosopher based at the City University of New York. He has made contributions in mathematical and philosophical logic, particularly set theory, as well as in group theory, computability theory and in the philosophy of set theory.

Biography

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 is 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.

Research Contributions

Hamkins research work is cited,^[1] and he gives talks,^[2] including events for the general public.^[3][4][5][6] Hamkins was interviewed on his research by Richard Marshall in 2013 for 3:AM Magazine, as part of an on-going interview series for that magazine of prominent philosophers and public intellectuals,^[7] and he is occasionally interviewed by the popular science media about issues in the philosophy of mathematics.^[8][9]

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^[10] and introducing the lottery preparation as a general method of forcing indestructibility.^[11] 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 S4.2.^[12] 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.^[13] 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.^[14]

Philosophy of Set Theory

In his philosophical work, Hamkins has defended a multiverse perspective of mathematical truth,^[15][16] 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..."^[17]

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.^[18]

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.^[19]

Group Theory

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

Infinite Chess

On the topic of infinite chess, Hamkins, Brumleve and Schlicht proved that the mate-in-n problem of infinite chess is decidable.^[21] 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.^[22]

MathOverflow

Hamkins is the top-rated^[23] user by reputation score on MathOverflow.^[24][25][26] 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."^[27]

References

External links

• Joel David Hamkins at the Mathematics Genealogy Project
• Hamkins's blog, Mathematics and philosophy of the infinite
• Joel David Hamkins on MathOverflow.
• Interview at 3AM Magazine, Playing infinite chess.