default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoel David Hamkins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j63]Joel David Hamkins
, Bokai Yao:
Reflection in second-order Set Theory with abundant urelements bi-interprets a Supercompact cardinal. J. Symb. Log. 89(3): 1007-1043 (2024)- [i5]Joel David Hamkins, Theodor Nenu:
Did Turing prove the undecidability of the halting problem? CoRR abs/2407.00680 (2024) - 2023
- [j62]Joel David Hamkins:
Infinite Wordle and the mastermind numbers. Math. Log. Q. 69(4): 400-416 (2023) - 2022
- [j61]Joel David Hamkins, Kameryn J. Williams:
The σ1-Definable Universal finite sequence. J. Symb. Log. 87(2): 783-801 (2022) - [j60]Raffaella Cutolo, Joel David Hamkins:
Choiceless large cardinals and set-theoretic potentialism. Math. Log. Q. 68(4): 409-415 (2022) - [j59]Joel David Hamkins, Øystein Linnebo:
The Modal Logic of Set-Theoretic Potentialism and the Potentialist Maximality Principles. Rev. Symb. Log. 15(1): 1-35 (2022) - [i4]Joel David Hamkins, Davide Leonessi:
Infinite Hex is a draw. CoRR abs/2201.06475 (2022) - [i3]Joel David Hamkins:
Infinite Wordle and the Mastermind numbers. CoRR abs/2203.06804 (2022) - 2021
- [j58]Alfredo Roque Freire, Joel David Hamkins:
Bi-Interpretation in Weak Set Theories. J. Symb. Log. 86(2): 609-634 (2021) - [i2]Joel David Hamkins, Davide Leonessi:
Transfinite game values in infinite draughts. CoRR abs/2111.02053 (2021) - 2020
- [j57]Victoria Gitman, Joel David Hamkins, Peter Holy, Philipp Schlicht, Kameryn J. Williams:
The exact strength of the class forcing Theorem. J. Symb. Log. 85(3): 869-905 (2020) - [j56]Neil Barton, Andrés Eduardo Caicedo, Gunter Fuchs, Joel David Hamkins, Jonas Reitz, Ralf Schindler:
Inner-Model Reflection Principles. Stud Logica 108(3): 573-595 (2020)
2010 – 2019
- 2019
- [j55]Victoria Gitman, Joel David Hamkins:
A model of the generic Vopěnka principle in which the ordinals are not Mahlo. Arch. Math. Log. 58(1-2): 245-265 (2019) - [j54]Miha E. Habic, Joel David Hamkins, Lukas Daniel Klausner, Jonathan Verner, Kameryn J. Williams:
Set-theoretic blockchains. Arch. Math. Log. 58(7-8): 965-997 (2019) - [j53]Marcia J. Groszek, Joel David Hamkins:
The Implicitly Constructible Universe. J. Symb. Log. 84(4): 1403-1421 (2019) - [j52]François G. Dorais, Joel David Hamkins:
When does every definable nonempty set have a definable element? Math. Log. Q. 65(4): 407-411 (2019) - 2018
- [j51]Ali Enayat, Joel David Hamkins:
Zfc Proves that the class of Ordinals is not Weakly Compact for Definable Classes. J. Symb. Log. 83(1): 146-164 (2018) - [j50]Gunter Fuchs, Victoria Gitman, Joel David Hamkins:
Ehrenfeucht's Lemma in Set Theory. Notre Dame J. Formal Log. 59(3): 355-370 (2018) - 2017
- [j49]Joel David Hamkins, Thomas A. Johnstone:
Strongly uplifting cardinals and the boldface resurrection axioms. Arch. Math. Log. 56(7-8): 1115-1133 (2017) - [j48]C. D. A. Evans, Joel David Hamkins, Norman Lewis Perlmutter:
A Position in Infinite Chess With Game Value ω4. Integers 17: G4 (2017) - [j47]Gunter Fuchs, Victoria Gitman, Joel David Hamkins:
Incomparable ω1-like models of set theory. Math. Log. Q. 63(1-2): 66-76 (2017) - [c9]Michal Tomasz Godziszewski, Joel David Hamkins:
Computable Quotient Presentations of Models of Arithmetic and Set Theory. WoLLIC 2017: 140-152 - 2016
- [j46]Joan Bagaria, Joel David Hamkins, Konstantinos Tsaprounis, Toshimichi Usuba:
Superstrong and other large cardinals are never Laver indestructible. Arch. Math. Log. 55(1-2): 19-35 (2016) - [j45]Victoria Gitman, Joel David Hamkins, Thomas A. Johnstone:
What is the theory without power set? Math. Log. Q. 62(4-5): 391-406 (2016) - [j44]Joel David Hamkins, Cole Leahy:
Algebraicity and Implicit Definability in Set Theory. Notre Dame J. Formal Log. 57(3): 431-439 (2016) - 2015
- [j43]Brent Cody, Moti Gitik, Joel David Hamkins, Jason A. Schanker:
The least weakly compact cardinal can be unfoldable, weakly measurable and nearly θ-supercompact. Arch. Math. Log. 54(5-6): 491-510 (2015) - [j42]Gunter Fuchs, Joel David Hamkins, Jonas Reitz:
Set-theoretic geology. Ann. Pure Appl. Log. 166(4): 464-501 (2015) - [j41]Yong Cheng, Sy-David Friedman, Joel David Hamkins:
Large cardinals need not be large in HOD. Ann. Pure Appl. Log. 166(11): 1186-1198 (2015) - [j40]Joel David Hamkins:
Is the Dream Solution of the Continuum Hypothesis Attainable? Notre Dame J. Formal Log. 56(1): 135-145 (2015) - 2014
- [j39]Joel David Hamkins, Thomas A. Johnstone:
Resurrection axioms and uplifting cardinals. Arch. Math. Log. 53(3-4): 463-485 (2014) - [j38]C. D. A. Evans, Joel David Hamkins:
Transfinite Game Values in Infinite Chess. Integers 14: G2 (2014) - 2013
- [j37]Joel David Hamkins:
Every Countable Model of Set Theory embeds into its Own Constructible Universe. J. Math. Log. 13(2): 1350006 (2013) - [j36]Joel David Hamkins, David Linetsky, Jonas Reitz:
Pointwise definable models of set theory. J. Symb. Log. 78(1): 139-156 (2013) - [c8]Joel David Hamkins, Benedikt Löwe:
Moving Up and Down in the Generic Multiverse. ICLA 2013: 139-147 - 2012
- [j35]Arthur W. Apter, Victoria Gitman, Joel David Hamkins:
Inner models with large cardinal features usually obtained by forcing. Arch. Math. Log. 51(3-4): 257-283 (2012) - [j34]Joel David Hamkins, Greg Kirmayer, Norman Lewis Perlmutter:
Generalizations of the Kunen inconsistency. Ann. Pure Appl. Log. 163(12): 1872-1890 (2012) - [j33]Samuel Coskey, Joel David Hamkins, Russell G. Miller:
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility. Comput. 1(1): 15-38 (2012) - [j32]Joel David Hamkins, Justin Palumbo:
The rigid relation principle, a new weak choice principle. Math. Log. Q. 58(6): 394-398 (2012) - [j31]Joel David Hamkins:
The Set-Theoretic Multiverse. Rev. Symb. Log. 5(3): 416-449 (2012) - [c7]Dan Brumleve, Joel David Hamkins, Philipp Schlicht:
The Mate-in-n Problem of Infinite Chess Is Decidable. CiE 2012: 78-88 - [i1]Dan Brumleve, Joel David Hamkins, Philipp Schlicht:
The mate-in-n problem of infinite chess is decidable. CoRR abs/1201.5597 (2012) - 2011
- [j30]Samuel Coskey, Joel David Hamkins:
Infinite Time Decidable Equivalence Relation Theory. Notre Dame J. Formal Log. 52(2): 203-228 (2011) - 2010
- [j29]Joel David Hamkins, Thomas A. Johnstone:
Indestructible Strong Unfoldability. Notre Dame J. Formal Log. 51(3): 291-321 (2010) - [j28]Victoria Gitman, Joel David Hamkins:
A Natural Model of the Multiverse Axioms. Notre Dame J. Formal Log. 51(4): 475-484 (2010)
2000 – 2009
- 2009
- [j27]Joel David Hamkins, Russell G. Miller:
Post's Problem for ordinal register machines: An explicit approach. Ann. Pure Appl. Log. 160(3): 302-309 (2009) - [j26]Gunter Fuchs, Joel David Hamkins:
Degrees of rigidity for Souslin trees. J. Symb. Log. 74(2): 423-454 (2009) - [j25]Joel David Hamkins:
Tall cardinals. Math. Log. Q. 55(1): 68-86 (2009) - [c6]Joel David Hamkins:
Some Second Order Set Theory. ICLA 2009: 36-50 - 2008
- [j24]Gunter Fuchs, Joel David Hamkins:
Changing the heights of automorphism towers by forcing with Souslin trees over L. J. Symb. Log. 73(2): 614-633 (2008) - 2007
- [c5]Joel David Hamkins, Russell G. Miller:
Post's Problem for Ordinal Register Machines. CiE 2007: 358-367 - [c4]Joel David Hamkins, David Linetsky, Russell G. Miller:
The Complexity of Quickly ORM-Decidable Sets. CiE 2007: 488-496 - [c3]Joel David Hamkins:
A Survey of Infinite Time Turing Machines. MCU 2007: 62-71 - 2006
- [j23]Mirna Dzamonja, Joel David Hamkins:
Diamond (on the regulars) can fail at any strongly unfoldable cardinal. Ann. Pure Appl. Log. 144(1-3): 83-95 (2006) - [j22]Joel David Hamkins, Alexei Miasnikov:
The Halting Problem Is Decidable on a Set of Asymptotic Probability One. Notre Dame J. Formal Log. 47(4): 515-524 (2006) - 2005
- [j21]Vinay Deolalikar, Joel David Hamkins, Ralf Schindler:
P != NP cap co-NP for Infinite Time Turing Machines. J. Log. Comput. 15(5): 577-592 (2005) - [j20]Joel David Hamkins, W. Hugh Woodin:
The Necessary Maximality Principle for c. c. c. forcing is equiconsistent with a weakly compact cardinal. Math. Log. Q. 51(5): 493-498 (2005) - [c2]Joel David Hamkins:
Infinitary Computability with Infinite Time Turing Machines. CiE 2005: 180-187 - 2003
- [j19]Joel David Hamkins:
A simple maximality principle. J. Symb. Log. 68(2): 527-550 (2003) - [j18]Arthur W. Apter, Joel David Hamkins:
Exactly controlling the non-supercompact strongly compact cardinals. J. Symb. Log. 68(2): 669-688 (2003) - [j17]Joel David Hamkins, Philip D. Welch:
Pf != NPf for almost all f. Math. Log. Q. 49(5): 536-540 (2003) - 2002
- [j16]Joel David Hamkins, Andrew Lewis:
Post's problem for supertasks has both positive and negative solutions. Arch. Math. Log. 41(6): 507-523 (2002) - [j15]Arthur W. Apter, Joel David Hamkins:
Indestructibility and The Level-By-Level Agreement Between Strong Compactness and Supercompactness. J. Symb. Log. 67(2): 820-840 (2002) - [j14]Joel David Hamkins:
Infinite Time Turing Machines. Minds Mach. 12(4): 521-539 (2002) - 2001
- [j13]Joel David Hamkins:
The Wholeness Axioms and V=HOD. Arch. Math. Log. 40(1): 1-8 (2001) - [j12]Joel David Hamkins:
Unfoldable Cardinals and The GCH. J. Symb. Log. 66(3): 1186-1198 (2001) - [j11]Joel David Hamkins, Daniel Evan Seabold:
Infinite Time Turing Machines With Only One Tape. Math. Log. Q. 47(2): 271-287 (2001) - [j10]Arthur W. Apter, Joel David Hamkins:
Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata. Math. Log. Q. 47(4): 563-571 (2001) - [c1]Joel David Hamkins:
Supertask computation. FotFS 2001: 141-158 - 2000
- [j9]Joel David Hamkins:
The Lottery Preparation. Ann. Pure Appl. Log. 101(2-3): 103-146 (2000) - [j8]Joel David Hamkins, Simon Thomas:
Changing the Heights of Automorphism Towers. Ann. Pure Appl. Log. 102(1-2): 139-157 (2000) - [j7]Joel David Hamkins, Andy Lewis:
Infinite Time Turing Machines. J. Symb. Log. 65(2): 567-604 (2000)
1990 – 1999
- 1999
- [j6]Joel David Hamkins:
Gap forcing: Generalizing the Lévy-Solovay theorem. Bull. Symb. Log. 5(2): 264-272 (1999) - 1998
- [j5]Joel David Hamkins:
Destruction or Preservation as You Like It. Ann. Pure Appl. Log. 91(2-3): 191-229 (1998) - [j4]Joel David Hamkins:
Small Forcing Makes Any Cardinal Superdestructable. J. Symb. Log. 63(1): 51-58 (1998) - [j3]Joel David Hamkins, Saharon Shelah:
Superdestructibility: A Dual to Laver's Indestructibility. J. Symb. Log. 63(2): 549-554 (1998) - 1997
- [j2]Joel David Hamkins:
Canonical Seeds and Prikiry Trees. J. Symb. Log. 62(2): 373-396 (1997) - 1994
- [j1]Joel David Hamkins:
Fragile Measurability. J. Symb. Log. 59(1): 262-282 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
