Knowledge

Joel David Hamkins

Source 📝

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

Index

Hamkins

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

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