Joel David Hamkins

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 24

Top Topics

Johnson Lindenstrauss

Top Venues

Arch. Math. Log.

Publications

Joel David Hamkins, Theodor Nenu
Did Turing prove the undecidability of the halting problem? CoRR (2024)
Joel David Hamkins
Infinite Wordle and the mastermind numbers. Math. Log. Q. 69 (4) (2023)
Raffaella Cutolo, Joel David Hamkins
Choiceless large cardinals and set-theoretic potentialism. Math. Log. Q. 68 (4) (2022)
Joel David Hamkins, Øystein Linnebo
The Modal Logic of Set-Theoretic Potentialism and the Potentialist Maximality Principles. Rev. Symb. Log. 15 (1) (2022)
Joel David Hamkins, Kameryn J. Williams
The σ1-Definable Universal finite sequence. J. Symb. Log. 87 (2) (2022)
Joel David Hamkins
Infinite Wordle and the Mastermind numbers. CoRR (2022)
Joel David Hamkins, Davide Leonessi
Infinite Hex is a draw. CoRR (2022)
Joel David Hamkins, Davide Leonessi
Transfinite game values in infinite draughts. CoRR (2021)
Alfredo Roque Freire, Joel David Hamkins
Bi-Interpretation in Weak Set Theories. J. Symb. Log. 86 (2) (2021)
Neil Barton, Andrés Eduardo Caicedo, Gunter Fuchs, Joel David Hamkins, Jonas Reitz, Ralf Schindler
Inner-Model Reflection Principles. Stud Logica 108 (3) (2020)
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) (2020)
François G. Dorais, Joel David Hamkins
When does every definable nonempty set have a definable element? Math. Log. Q. 65 (4) (2019)
Miha E. Habic, Joel David Hamkins, Lukas Daniel Klausner, Jonathan Verner, Kameryn J. Williams
Set-theoretic blockchains. Arch. Math. Log. 58 (7-8) (2019)
Marcia J. Groszek, Joel David Hamkins
The Implicitly Constructible Universe. J. Symb. Log. 84 (4) (2019)
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) (2019)
Ali Enayat, Joel David Hamkins
Zfc Proves that the class of Ordinals is not Weakly Compact for Definable Classes. J. Symb. Log. 83 (1) (2018)
Gunter Fuchs, Victoria Gitman, Joel David Hamkins
Ehrenfeucht's Lemma in Set Theory. Notre Dame J. Formal Log. 59 (3) (2018)
Joel David Hamkins, Thomas A. Johnstone
Strongly uplifting cardinals and the boldface resurrection axioms. Arch. Math. Log. 56 (7-8) (2017)
C. D. A. Evans, Joel David Hamkins, Norman Lewis Perlmutter
A Position in Infinite Chess With Game Value ω4. Integers 17 (2017)
Gunter Fuchs, Victoria Gitman, Joel David Hamkins
-like models of set theory. Math. Log. Q. 63 (1-2) (2017)
Michal Tomasz Godziszewski, Joel David Hamkins
Computable Quotient Presentations of Models of Arithmetic and Set Theory. WoLLIC (2017)
Joan Bagaria, Joel David Hamkins, Konstantinos Tsaprounis, Toshimichi Usuba
Superstrong and other large cardinals are never Laver indestructible. Arch. Math. Log. 55 (1-2) (2016)
Joel David Hamkins, Cole Leahy
Algebraicity and Implicit Definability in Set Theory. Notre Dame J. Formal Log. 57 (3) (2016)
Victoria Gitman, Joel David Hamkins, Thomas A. Johnstone
What is the theory without power set? Math. Log. Q. 62 (4-5) (2016)
Joel David Hamkins
Is the Dream Solution of the Continuum Hypothesis Attainable? Notre Dame J. Formal Log. 56 (1) (2015)
Yong Cheng, Sy-David Friedman, Joel David Hamkins
Large cardinals need not be large in HOD. Ann. Pure Appl. Log. 166 (11) (2015)
Gunter Fuchs, Joel David Hamkins, Jonas Reitz
Set-theoretic geology. Ann. Pure Appl. Log. 166 (4) (2015)
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) (2015)
C. D. A. Evans, Joel David Hamkins
Transfinite Game Values in Infinite Chess. Integers 14 (2014)
Joel David Hamkins, Thomas A. Johnstone
Resurrection axioms and uplifting cardinals. Arch. Math. Log. 53 (3-4) (2014)
Joel David Hamkins
Every Countable Model of Set Theory embeds into its Own Constructible Universe. J. Math. Log. 13 (2) (2013)
Joel David Hamkins, Benedikt Löwe
Moving Up and Down in the Generic Multiverse. ICLA (2013)
Joel David Hamkins, David Linetsky, Jonas Reitz
Pointwise definable models of set theory. J. Symb. Log. 78 (1) (2013)
Dan Brumleve, Joel David Hamkins, Philipp Schlicht
The Mate-in-n Problem of Infinite Chess Is Decidable. CiE (2012)
Dan Brumleve, Joel David Hamkins, Philipp Schlicht
The mate-in-n problem of infinite chess is decidable CoRR (2012)
Joel David Hamkins, Justin Palumbo
The rigid relation principle, a new weak choice principle. Math. Log. Q. 58 (6) (2012)
Joel David Hamkins
The Set-Theoretic Multiverse. Rev. Symb. Log. 5 (3) (2012)
Joel David Hamkins, Greg Kirmayer, Norman Lewis Perlmutter
Generalizations of the Kunen inconsistency. Ann. Pure Appl. Log. 163 (12) (2012)
Arthur W. Apter, Victoria Gitman, Joel David Hamkins
Inner models with large cardinal features usually obtained by forcing. Arch. Math. Log. 51 (3-4) (2012)
Samuel Coskey, Joel David Hamkins, Russell G. Miller
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility. Comput. 1 (1) (2012)
Samuel Coskey, Joel David Hamkins
Infinite Time Decidable Equivalence Relation Theory. Notre Dame J. Formal Log. 52 (2) (2011)
Victoria Gitman, Joel David Hamkins
A Natural Model of the Multiverse Axioms. Notre Dame J. Formal Log. 51 (4) (2010)
Joel David Hamkins, Thomas A. Johnstone
Indestructible Strong Unfoldability. Notre Dame J. Formal Log. 51 (3) (2010)
Joel David Hamkins
Some Second Order Set Theory. ICLA (2009)
Joel David Hamkins
Tall cardinals. Math. Log. Q. 55 (1) (2009)
Joel David Hamkins, Russell G. Miller
Post's Problem for ordinal register machines: An explicit approach. Ann. Pure Appl. Log. 160 (3) (2009)
Gunter Fuchs, Joel David Hamkins
Degrees of rigidity for Souslin trees. J. Symb. Log. 74 (2) (2009)
Gunter Fuchs, Joel David Hamkins
Changing the heights of automorphism towers by forcing with Souslin trees over L. J. Symb. Log. 73 (2) (2008)
Joel David Hamkins, David Linetsky, Russell G. Miller
The Complexity of Quickly ORM-Decidable Sets. CiE (2007)
Joel David Hamkins, Russell G. Miller
Post's Problem for Ordinal Register Machines. CiE (2007)
Joel David Hamkins
A Survey of Infinite Time Turing Machines. MCU (2007)
Joel David Hamkins, Alexei Miasnikov
The Halting Problem Is Decidable on a Set of Asymptotic Probability One. Notre Dame J. Formal Log. 47 (4) (2006)
Mirna Dzamonja, Joel David Hamkins
Diamond (on the regulars) can fail at any strongly unfoldable cardinal. Ann. Pure Appl. Log. 144 (1-3) (2006)
Joel David Hamkins
Infinitary Computability with Infinite Time Turing Machines. CiE (2005)
Vinay Deolalikar, Joel David Hamkins, Ralf Schindler
P != NP cap co-NP for Infinite Time Turing Machines. J. Log. Comput. 15 (5) (2005)
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) (2005)
Joel David Hamkins, Philip D. Welch
for almost all f. Math. Log. Q. 49 (5) (2003)
Arthur W. Apter, Joel David Hamkins
Exactly controlling the non-supercompact strongly compact cardinals. J. Symb. Log. 68 (2) (2003)
Joel David Hamkins
A simple maximality principle. J. Symb. Log. 68 (2) (2003)
Arthur W. Apter, Joel David Hamkins
Indestructibility and The Level-By-Level Agreement Between Strong Compactness and Supercompactness. J. Symb. Log. 67 (2) (2002)
Joel David Hamkins, Andrew Lewis
Post's problem for supertasks has both positive and negative solutions. Arch. Math. Log. 41 (6) (2002)
Joel David Hamkins
Infinite Time Turing Machines. Minds Mach. 12 (4) (2002)
Arthur W. Apter, Joel David Hamkins
Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata. Math. Log. Q. 47 (4) (2001)
Joel David Hamkins
The Wholeness Axioms and V=HOD. Arch. Math. Log. 40 (1) (2001)
Joel David Hamkins
Supertask computation. FotFS (2001)
Joel David Hamkins, Daniel Evan Seabold
Infinite Time Turing Machines With Only One Tape. Math. Log. Q. 47 (2) (2001)
Joel David Hamkins
Unfoldable Cardinals and The GCH. J. Symb. Log. 66 (3) (2001)
Joel David Hamkins, Andy Lewis
Infinite Time Turing Machines. J. Symb. Log. 65 (2) (2000)
Joel David Hamkins
The Lottery Preparation. Ann. Pure Appl. Log. 101 (2-3) (2000)
Joel David Hamkins, Simon Thomas
Changing the Heights of Automorphism Towers. Ann. Pure Appl. Log. 102 (1-2) (2000)
Joel David Hamkins
Gap forcing: Generalizing the Lévy-Solovay theorem. Bull. Symb. Log. 5 (2) (1999)
Joel David Hamkins
Small Forcing Makes Any Cardinal Superdestructable. J. Symb. Log. 63 (1) (1998)
Joel David Hamkins
Destruction or Preservation as You Like It. Ann. Pure Appl. Log. 91 (2-3) (1998)
Joel David Hamkins, Saharon Shelah
Superdestructibility: A Dual to Laver's Indestructibility. J. Symb. Log. 63 (2) (1998)
Joel David Hamkins
Canonical Seeds and Prikiry Trees. J. Symb. Log. 62 (2) (1997)
Joel David Hamkins
Fragile Measurability. J. Symb. Log. 59 (1) (1994)