Knowledge

Joel David Hamkins

Source 📝

31: 397:. 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 and Davide Leonessi proved that every countable ordinal arises as a game value in infinite draughts. They also proved that infinite Hex is a draw. 299:, 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. 294:
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
320:
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
290:, 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 333:, he introduced several varieties of set-theoretic potentialism. 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 337:. 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. 360:
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
274:, 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. 315:
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)
385:
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-
425:
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."
311:
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
561:
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.
405:
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
374: 1157:
How the World Computes – Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, United Kingdom, June 18–23, 2012. Proceedings
268:
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
1378: 1358: 608: 1373: 1353: 1348: 946:
Hamkins, Joel David; Linnebo, Øystein (2022). "THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES".
1393: 1383: 511: 1388: 1273: 210: 1285: 1073:
Hamkins, Joel David; Miasnikov, Alexei (2006). "The Halting Problem Is Decidable on a Set of Asymptotic Probability One".
178: 170: 53: 49: 201:
in 1995, where he was a member of the doctoral faculties in Mathematics, in Philosophy and in Computer Science at the
573:, The Intrinsic Value Project, Underground Zero, New York City, July 9 & 10, 2014. (Hamkins was a panelist.) 812:
Hamkins, Joel David (2013). "Every countable model of set theory embeds into its own constructible universe".
525: 1305: 621: 346: 1363: 329:
Hamkins has investigated a model-theoretic account of the philosophy of potentialism. In joint work with
252:
to become Professor of Logic in the Faculty of Philosophy and Sir Peter Strawson Fellow in Philosophy in
198: 92: 767:
Hamkins, Joel David (2013). "David Linetsky and Jonas Reitz, Pointwise definable models of set theory".
373:
In group theory, Hamkins proved that every group has a terminating transfinite automorphism tower. With
582: 253: 218: 129:
is an American mathematician and philosopher who is the John Cardinal O'Hara Professor of Logic at the
114: 472: 451: 257: 226: 206: 146: 130: 84: 1155:
problem of infinite chess is decidable". In Cooper, S. Barry; Dawar, Anuj; Löwe, Benedikt (eds.).
498:"Oxford University, Professor of Logic & Sir Peter Strawson Fellow, University College Oxford" 222: 362: 308: 230: 1368: 1343: 1234: 549: 497: 446: 354: 242: 377:, he proved that the height of the automorphism tower of a group can be modified by forcing. 190: 394: 312: 249: 202: 150: 88: 933: 570: 8: 1316: 238: 166: 138: 1327: 1200:
Joel David Hamkins and Davide Leonessi. "Transfinite game values in infinite draughts,"
901:
J. D. Hamkins, The multiverse perspective on determinateness in set theory, talk at the
595: 1160: 1100: 1082: 1055: 1047: 1029: 992: 955: 884: 866: 839: 821: 794: 776: 749: 731: 704: 669: 661: 643: 134: 700: 330: 1059: 917: 317: 283: 30: 1104: 888: 843: 798: 753: 708: 673: 1170: 1131: 1092: 1039: 1002: 965: 929: 906: 876: 831: 786: 741: 696: 653: 350: 234: 182: 99: 1136: 1119: 745: 634:
Hamkins, Joel David (1998). "Small Forcing Makes any Cardinal Superdestructible".
291: 983:
Hamkins, Joel David; Wołoszyn, Wojciech Aleksander (2022). "Modal model theory".
214: 1222: 1205: 1174: 585:, World Science Festival, New York City, June 1, 2013. (Hamkins was a panelist.) 1187:
C. D. A. Evans and J. D. Hamkins, "Transfinite game values in infinite chess,"
1159:. Lecture Notes in Computer Science. Vol. 7318. Springer. pp. 78–88. 1096: 1006: 390: 334: 287: 186: 104: 969: 880: 835: 1337: 571:
A Meeting at the Crossroads - Science, Performance and the Art of Possibility
270: 1301: 295:
and class is definable without parameters. Hamkins and Reitz introduced the
1320: 1151:
Brumleve, Dan; Hamkins, Joel David; Schlicht, Philipp (2012). "The mate-in-
418: 296: 154: 1020:
Hamkins, Joel David; Lewis, Andy (2000). "Infinite-time Turing machines".
722:
Hamkins, Joel David; Löwe, Benedikt (2008). "The modal logic of forcing".
537: 321:
amazingly fecund developments spearheaded by the author and...others..."
70: 790: 1260: 1247: 1051: 665: 365:
showing that a difficult or unsolvable problem can be easy on average.
142: 74: 921: 552:, Helix Center roundtable, October 25, 2014. (Hamkins was a panelist.) 1087: 1034: 736: 422: 1043: 922:
Zentralblatt review of J. D. Hamkins, The set-theoretic multiverse,
657: 1217:
Joel David Hamkins and Davide Leonessi. "Infinite Hex is a draw,"
997: 960: 902: 648: 406: 209:. He has also held various faculty or visiting fellow positions at 1165: 871: 826: 781: 1250:
of Hamkins breaking 100,000 reputation score, September 17, 2014.
345:
Hamkins introduced with Jeff Kidder and Andy Lewis the theory of
195:
Lifting and Extending Measures by Forcing; Fragile Measurability.
624:, Science News, Volume 164, Number 9, August 30, 2003, page 139. 583:
The Future of Infinity: Solving Math's Most Notorious Problem
174: 857:
Hamkins, Joel David (2012). "The set-theoretic multiverse".
512:"Notre Dame Hires Hamkins from Oxford and Montero from CUNY" 145:
and philosophy of set theory (particularly the idea of the
1311: 1288:
on Hamkins's MathOverflow achievements, January 29, 2014.
1150: 687:
Hamkins, Joel David (2000). "The Lottery Preparation".
609:
Mathematicians Think Like Machines for Perfect Proofs
417:
Hamkins is the top-rated user by reputation score on
1263:
of Hamkins posting 1000th answer, January 30, 2014.
1225:, doi: 10.5281/zenodo.10075843, arXiv:2201.06475. 1120:"Every group has a terminating automorphism tower" 307:In his philosophical work, Hamkins has defended a 724:Transactions of the American Mathematical Society 1335: 1124:Proceedings of the American Mathematical Society 1072: 260:as the John Cardinal O'Hara Professor of Logic. 1276:, Simons Foundation Science News, May 18, 2011. 982: 945: 1223:http://math.colgate.edu/~integers/xg6/xg6.pdf 1206:http://math.colgate.edu/~integers/wg5/wg5.pdf 1019: 282:In set theory, Hamkins has investigated the 721: 340: 302: 1312:Mathematics and philosophy of the infinite 29: 1379:California Institute of Technology alumni 1359:University of California, Berkeley alumni 1164: 1135: 1086: 1033: 996: 959: 903:Exploring the Frontiers of Incompleteness 870: 825: 780: 735: 647: 263: 905:, Harvard University, October 19, 2011. 248:In September 2018, Hamkins moved to the 1191:, volume 14, Paper Number G2, 36, 2014. 1117: 856: 811: 766: 686: 633: 495: 1336: 1374:Fellows of University College, Oxford 1354:21st-century American mathematicians 1349:20th-century American mathematicians 1204:, volume 22, Paper Number G5, 2022. 496:Hamkins, Joel David (May 17, 2018). 211:University of California at Berkeley 205:and professor of mathematics at the 926:, 5, Number 3, pages 416-449 (2012) 13: 985:Notre Dame Journal of Formal Logic 400: 256:. In January 2022 he moved to the 179:University of California, Berkeley 171:California Institute of Technology 54:California Institute of Technology 50:University of California, Berkeley 14: 1405: 1295: 380: 1394:College of Staten Island faculty 1384:University of Notre Dame faculty 689:Annals of Pure and Applied Logic 1279: 1266: 1253: 1240: 1228: 1211: 1194: 1181: 1144: 1111: 1066: 1013: 976: 939: 911: 895: 850: 805: 760: 715: 680: 627: 614: 601: 598:, 3AM Magazine, March 25, 2013. 588: 576: 412: 368: 324: 133:. He has made contributions in 564: 555: 543: 531: 518: 504: 489: 465: 439: 177:in mathematics in 1994 at the 1: 1306:Mathematics Genealogy Project 1137:10.1090/s0002-9939-98-04797-2 1022:The Journal of Symbolic Logic 769:The Journal of Symbolic Logic 746:10.1090/s0002-9947-07-04297-3 701:10.1016/S0168-0072(99)00010-X 636:The Journal of Symbolic Logic 432: 347:infinite-time Turing machines 277: 197:He joined the faculty of the 1389:CUNY Graduate Center faculty 1118:Hamkins, Joel David (1998). 948:The Review of Symbolic Logic 859:The Review of Symbolic Logic 611:New Scientist, 26 June 2013. 160: 7: 1326:Interview at 3AM Magazine, 1175:10.1007/978-3-642-30870-3_9 349:, a part of the subject of 199:City University of New York 93:City University of New York 10: 1410: 1075:Notre Dame J. Formal Logic 1007:10.1215/00294527-2024-0001 540:, from Hamkins's web page. 254:University College, Oxford 219:Carnegie Mellon University 970:10.1017/S1755020318000242 881:10.1017/S1755020311000359 836:10.1142/S0219061313500062 120: 110: 98: 80: 66: 59: 45: 37: 28: 21: 1097:10.1305/ndjfl/1168352664 924:Review of Symbolic Logic 452:University of Notre Dame 341:Infinitary computability 303:Philosophy of set theory 258:University of Notre Dame 227:Georgia State University 207:College of Staten Island 147:set-theoretic multiverse 131:University of Notre Dame 115:José R. Ramírez-Garofalo 85:University of Notre Dame 1274:The Global Math Commons 1221:, volume 23, paper G6, 363:generic-case complexity 231:University of Amsterdam 1328:Playing infinite chess 1237:, by reputation score. 596:Playing Infinite Chess 526:Google Scholar profile 355:descriptive set theory 353:, with connections to 264:Research contributions 243:Isaac Newton Institute 169:in mathematics at the 16:American mathematician 223:University of Münster 173:, Hamkins earned his 550:The Span of Infinity 514:. 23 September 2021. 447:"Joel David Hamkins" 313:Continuum Hypothesis 250:University of Oxford 203:CUNY Graduate Center 151:computability theory 89:University of Oxford 791:10.2178/jsl.7801090 409:juggling notation. 239:New York University 167:Bachelor of Science 139:philosophical logic 1364:American logicians 1317:Joel David Hamkins 1302:Joel David Hamkins 1235:MathOverflow users 1208:. arXiv:2111.02053 594:Richard Marshall, 127:Joel David Hamkins 23:Joel David Hamkins 1272:Erica Klarreich, 1130:(11): 3223–3226. 918:Elliott Mendelson 620:Erica Klarreich, 473:"Curriculum Vita" 318:Elliott Mendelson 284:indestructibility 124: 123: 61:Scientific career 1401: 1310:Hamkins's blog, 1289: 1283: 1277: 1270: 1264: 1257: 1251: 1244: 1238: 1232: 1226: 1215: 1209: 1198: 1192: 1185: 1179: 1178: 1168: 1154: 1148: 1142: 1141: 1139: 1115: 1109: 1108: 1090: 1070: 1064: 1063: 1037: 1017: 1011: 1010: 1000: 980: 974: 973: 963: 943: 937: 915: 909: 899: 893: 892: 874: 854: 848: 847: 829: 809: 803: 802: 784: 764: 758: 757: 739: 730:(4): 1793–1817. 719: 713: 712: 695:(2–3): 103–146. 684: 678: 677: 651: 631: 625: 618: 612: 605: 599: 592: 586: 580: 574: 568: 562: 559: 553: 547: 541: 535: 529: 522: 516: 515: 508: 502: 501: 493: 487: 486: 484: 482: 477: 469: 463: 462: 460: 459: 443: 351:hypercomputation 235:Fields Institute 165:After earning a 111:Notable students 100:Doctoral advisor 33: 19: 18: 1409: 1408: 1404: 1403: 1402: 1400: 1399: 1398: 1334: 1333: 1298: 1293: 1292: 1284: 1280: 1271: 1267: 1258: 1254: 1245: 1241: 1233: 1229: 1216: 1212: 1199: 1195: 1186: 1182: 1152: 1149: 1145: 1116: 1112: 1071: 1067: 1044:10.2307/2586556 1018: 1014: 981: 977: 944: 940: 916: 912: 900: 896: 855: 851: 810: 806: 765: 761: 720: 716: 685: 681: 658:10.2307/2586586 632: 628: 622:Infinite Wisdom 619: 615: 606: 602: 593: 589: 581: 577: 569: 565: 560: 556: 548: 544: 536: 532: 524:J. D. Hamkins: 523: 519: 510: 509: 505: 494: 490: 480: 478: 475: 471: 470: 466: 457: 455: 445: 444: 440: 435: 429: 415: 403: 401:Juggling theory 383: 371: 343: 331:Øystein Linnebo 327: 305: 288:large cardinals 280: 266: 215:Kobe University 163: 91: 87: 52: 46:Alma mater 24: 17: 12: 11: 5: 1407: 1397: 1396: 1391: 1386: 1381: 1376: 1371: 1366: 1361: 1356: 1351: 1346: 1332: 1331: 1324: 1314: 1308: 1297: 1296:External links 1294: 1291: 1290: 1278: 1265: 1252: 1239: 1227: 1210: 1193: 1180: 1143: 1110: 1081:(4): 515–524. 1065: 1028:(2): 567–604. 1012: 975: 938: 910: 894: 865:(3): 416–449. 849: 820:(2): 1350006. 804: 775:(1): 139–156. 759: 714: 679: 626: 613: 600: 587: 575: 563: 554: 542: 530: 517: 503: 488: 464: 437: 436: 434: 431: 414: 411: 402: 399: 391:infinite chess 382: 381:Infinite games 379: 370: 367: 342: 339: 335:W. Hugh Woodin 326: 323: 304: 301: 286:phenomenon of 279: 276: 265: 262: 187:W. Hugh Woodin 162: 159: 122: 121: 118: 117: 112: 108: 107: 105:W. Hugh Woodin 102: 96: 95: 82: 78: 77: 68: 64: 63: 57: 56: 47: 43: 42: 39: 35: 34: 26: 25: 22: 15: 9: 6: 4: 3: 2: 1406: 1395: 1392: 1390: 1387: 1385: 1382: 1380: 1377: 1375: 1372: 1370: 1369:Set theorists 1367: 1365: 1362: 1360: 1357: 1355: 1352: 1350: 1347: 1345: 1344:Living people 1342: 1341: 1339: 1329: 1325: 1322: 1318: 1315: 1313: 1309: 1307: 1303: 1300: 1299: 1287: 1282: 1275: 1269: 1262: 1259:MathOverflow 1256: 1249: 1246:MathOverflow 1243: 1236: 1231: 1224: 1220: 1214: 1207: 1203: 1197: 1190: 1184: 1176: 1172: 1167: 1162: 1158: 1147: 1138: 1133: 1129: 1125: 1121: 1114: 1106: 1102: 1098: 1094: 1089: 1084: 1080: 1076: 1069: 1061: 1057: 1053: 1049: 1045: 1041: 1036: 1031: 1027: 1023: 1016: 1008: 1004: 999: 994: 990: 986: 979: 971: 967: 962: 957: 953: 949: 942: 935: 931: 927: 925: 919: 914: 908: 904: 898: 890: 886: 882: 878: 873: 868: 864: 860: 853: 845: 841: 837: 833: 828: 823: 819: 815: 808: 800: 796: 792: 788: 783: 778: 774: 770: 763: 755: 751: 747: 743: 738: 733: 729: 725: 718: 710: 706: 702: 698: 694: 690: 683: 675: 671: 667: 663: 659: 655: 650: 645: 641: 637: 630: 623: 617: 610: 604: 597: 591: 584: 579: 572: 567: 558: 551: 546: 539: 538:List of talks 534: 527: 521: 513: 507: 499: 492: 474: 468: 454: 453: 448: 442: 438: 430: 427: 424: 420: 410: 408: 398: 396: 392: 388: 378: 376: 366: 364: 358: 356: 352: 348: 338: 336: 332: 322: 319: 314: 310: 300: 298: 293: 292:Benedikt Löwe 289: 285: 275: 273: 272: 271:3:AM Magazine 261: 259: 255: 251: 246: 244: 240: 236: 232: 228: 224: 220: 216: 212: 208: 204: 200: 196: 192: 188: 184: 180: 176: 172: 168: 158: 156: 152: 148: 144: 140: 136: 132: 128: 119: 116: 113: 109: 106: 103: 101: 97: 94: 90: 86: 83: 79: 76: 72: 69: 65: 62: 58: 55: 51: 48: 44: 40: 36: 32: 27: 20: 1321:MathOverflow 1281: 1268: 1261:announcement 1255: 1248:announcement 1242: 1230: 1218: 1213: 1201: 1196: 1188: 1183: 1156: 1146: 1127: 1123: 1113: 1088:math/0504351 1078: 1074: 1068: 1035:math/9808093 1025: 1021: 1015: 988: 984: 978: 951: 947: 941: 923: 913: 897: 862: 858: 852: 817: 814:J. Math. Log 813: 807: 772: 768: 762: 737:math/0509616 727: 723: 717: 692: 688: 682: 642:(1): 51–58. 639: 635: 629: 616: 607:Jacob Aron, 603: 590: 578: 566: 557: 545: 533: 520: 506: 491: 479:. Retrieved 467: 456:. Retrieved 450: 441: 428: 419:MathOverflow 416: 413:MathOverflow 404: 386: 384: 375:Simon Thomas 372: 369:Group theory 359: 344: 328: 325:Potentialism 306: 297:ground axiom 281: 269: 267: 247: 194: 191:dissertation 164: 155:group theory 135:mathematical 126: 125: 81:Institutions 60: 991:(1): 1–37. 954:(1): 1–35. 389:problem of 183:supervision 71:Mathematics 38:Nationality 1338:Categories 998:2009.09394 961:1708.01644 934:1260.03103 649:1607.00684 481:5 February 458:2022-01-05 433:References 309:multiverse 278:Set theory 181:under the 143:set theory 75:Philosophy 1286:Gil Kalai 1166:1201.5597 1060:125601911 872:1108.4223 827:1207.0963 782:1105.4597 423:Gil Kalai 395:decidable 193:entitled 189:, with a 161:Biography 153:, and in 1219:Integers 1202:Integers 1189:Integers 1105:15005164 889:33807508 844:18836919 799:43689192 754:14724471 709:15579965 674:40252670 407:siteswap 241:and the 41:American 1304:at the 1052:2586556 666:2586586 1103:  1058:  1050:  932:  887:  842:  797:  752:  707:  672:  664:  233:, the 149:), in 67:Fields 1161:arXiv 1101:S2CID 1083:arXiv 1056:S2CID 1048:JSTOR 1030:arXiv 993:arXiv 956:arXiv 907:video 885:S2CID 867:arXiv 840:S2CID 822:arXiv 795:S2CID 777:arXiv 750:S2CID 732:arXiv 705:S2CID 670:S2CID 662:JSTOR 644:arXiv 476:(PDF) 175:Ph.D. 483:2020 137:and 1319:on 1171:doi 1132:doi 1128:126 1093:doi 1040:doi 1003:doi 966:doi 930:Zbl 877:doi 832:doi 787:doi 742:doi 728:360 697:doi 693:101 654:doi 393:is 185:of 1340:: 1169:. 1126:. 1122:. 1099:. 1091:. 1079:47 1077:. 1054:. 1046:. 1038:. 1026:65 1024:. 1001:. 989:65 987:. 964:. 952:15 950:. 928:, 920:, 883:. 875:. 861:. 838:. 830:. 818:13 816:. 793:. 785:. 773:78 771:. 748:. 740:. 726:. 703:. 691:. 668:. 660:. 652:. 640:63 638:. 449:. 421:. 357:. 245:. 237:, 229:, 225:, 221:, 217:, 213:, 157:. 141:, 73:, 1330:. 1323:. 1177:. 1173:: 1163:: 1153:n 1140:. 1134:: 1107:. 1095:: 1085:: 1062:. 1042:: 1032:: 1009:. 1005:: 995:: 972:. 968:: 958:: 936:. 891:. 879:: 869:: 863:5 846:. 834:: 824:: 801:. 789:: 779:: 756:. 744:: 734:: 711:. 699:: 676:. 656:: 646:: 528:. 500:. 485:. 461:. 387:n

Index


University of California, Berkeley
California Institute of Technology
Mathematics
Philosophy
University of Notre Dame
University of Oxford
City University of New York
Doctoral advisor
W. Hugh Woodin
José R. Ramírez-Garofalo
University of Notre Dame
mathematical
philosophical logic
set theory
set-theoretic multiverse
computability theory
group theory
Bachelor of Science
California Institute of Technology
Ph.D.
University of California, Berkeley
supervision
W. Hugh Woodin
dissertation
City University of New York
CUNY Graduate Center
College of Staten Island
University of California at Berkeley
Kobe University

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.