default search action
Joel David Hamkins
- > Home > Persons > Joel David Hamkins
Publications
- 2022
- [j61]Joel David Hamkins, Kameryn J. Williams:
The σ1-Definable Universal finite sequence. J. Symb. Log. 87(2): 783-801 (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) - 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
Inner-Model Reflection Principles. Stud Logica 108(3): 573-595 (2020) - 2019
- [j55]Victoria Gitman
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
Set-theoretic blockchains. Arch. Math. Log. 58(7-8): 965-997 (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
Ehrenfeucht's Lemma in Set Theory. Notre Dame J. Formal Log. 59(3): 355-370 (2018) - 2017
- [j49]Joel David Hamkins
Strongly uplifting cardinals and the boldface resurrection axioms. Arch. Math. Log. 56(7-8): 1115-1133 (2017) - [j47]Gunter Fuchs
Incomparable ω1-like models of set theory. Math. Log. Q. 63(1-2): 66-76 (2017) - 2016
- [j46]Joan Bagaria
Superstrong and other large cardinals are never Laver indestructible. Arch. Math. Log. 55(1-2): 19-35 (2016) - [j45]Victoria Gitman
What is the theory without power set? Math. Log. Q. 62(4-5): 391-406 (2016) - 2015
- [j43]Brent Cody
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
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) - 2014
- [j39]Joel David Hamkins
Resurrection axioms and uplifting cardinals. Arch. Math. Log. 53(3-4): 463-485 (2014) - 2013
- [j36]Joel David Hamkins
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
Inner models with large cardinal features usually obtained by forcing. Arch. Math. Log. 51(3-4): 257-283 (2012) - [j33]Samuel Coskey, Joel David Hamkins
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility. Comput. 1(1): 15-38 (2012) - [c7]Dan Brumleve, Joel David Hamkins
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
Infinite Time Decidable Equivalence Relation Theory. Notre Dame J. Formal Log. 52(2): 203-228 (2011) - 2010
- [j29]Joel David Hamkins
Indestructible Strong Unfoldability. Notre Dame J. Formal Log. 51(3): 291-321 (2010) - [j28]Victoria Gitman
A Natural Model of the Multiverse Axioms. Notre Dame J. Formal Log. 51(4): 475-484 (2010) - 2009
- [j27]Joel David Hamkins
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) - 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
Post's Problem for Ordinal Register Machines. CiE 2007: 358-367 - [c4]Joel David Hamkins
The Complexity of Quickly ORM-Decidable Sets. CiE 2007: 488-496 - 2006
- [j23]Mirna Dzamonja
Diamond (on the regulars) can fail at any strongly unfoldable cardinal. Ann. Pure Appl. Log. 144(1-3): 83-95 (2006) - 2005
- [j21]Vinay Deolalikar, Joel David Hamkins
P != NP cap co-NP for Infinite Time Turing Machines. J. Log. Comput. 15(5): 577-592 (2005) - [j20]Joel David Hamkins
The Necessary Maximality Principle for c. c. c. forcing is equiconsistent with a weakly compact cardinal. Math. Log. Q. 51(5): 493-498 (2005) - 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
Pf != NPf for almost all f. Math. Log. Q. 49(5): 536-540 (2003) - 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) - 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) - 2000
- [j8]Joel David Hamkins
Changing the Heights of Automorphism Towers. Ann. Pure Appl. Log. 102(1-2): 139-157 (2000) - 1998
- [j3]Joel David Hamkins
Superdestructibility: A Dual to Laver's Indestructibility. J. Symb. Log. 63(2): 549-554 (1998)
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-03-04 22:17 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: