Fragile Measurability. - Joel David Hamkins (J. Symb. Log., 1994)

Canonical Seeds and Prikiry Trees. - Joel David Hamkins (J. Symb. Log., 1997)

Destruction or Preservation as You Like It. - Joel David Hamkins (Ann. Pure Appl. Log., 1998)

Small Forcing Makes Any Cardinal Superdestructable. - Joel David Hamkins (J. Symb. Log., 1998)

Superdestructibility: A Dual to Laver's Indestructibility. - Joel David Hamkins; Saharon Shelah (J. Symb. Log., 1998)

Gap forcing: Generalizing the Lévy-Solovay theorem. - Joel David Hamkins (Bull. Symb. Log., 1999)

The Lottery Preparation. - Joel David Hamkins (Ann. Pure Appl. Log., 2000)

Changing the Heights of Automorphism Towers. - Joel David Hamkins; Simon Thomas 001 (Ann. Pure Appl. Log., 2000)

Infinite Time Turing Machines. - Joel David Hamkins; Andy Lewis (J. Symb. Log., 2000)

Supertask computation. - Joel David Hamkins (FotFS, 2001)

The Wholeness Axioms and V=HOD. - Joel David Hamkins (Arch. Math. Log., 2001)

Unfoldable Cardinals and The GCH. - Joel David Hamkins (J. Symb. Log., 2001)

Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata. - Arthur W. Apter; Joel David Hamkins (Math. Log. Q., 2001)

Infinite Time Turing Machines With Only One Tape. - Joel David Hamkins; Daniel Evan Seabold (Math. Log. Q., 2001)

Post's problem for supertasks has both positive and negative solutions. - Joel David Hamkins; Andrew Lewis (Arch. Math. Log., 2002)

Indestructibility and The Level-By-Level Agreement Between Strong Compactness and Supercompactness. - Arthur W. Apter; Joel David Hamkins (J. Symb. Log., 2002)

Infinite Time Turing Machines. - Joel David Hamkins (Minds Mach., 2002)

Exactly controlling the non-supercompact strongly compact cardinals. - Arthur W. Apter; Joel David Hamkins (J. Symb. Log., 2003)

A simple maximality principle. - Joel David Hamkins (J. Symb. Log., 2003)

Pf != NPf for almost all f. - Joel David Hamkins; Philip D. Welch (Math. Log. Q., 2003)

Infinitary Computability with Infinite Time Turing Machines. - Joel David Hamkins (CiE, 2005)

P != NP cap co-NP for Infinite Time Turing Machines. - Vinay Deolalikar; Joel David Hamkins; Ralf Schindler (J. Log. Comput., 2005)

The Necessary Maximality Principle for c. c. c. forcing is equiconsistent with a weakly compact cardinal. - Joel David Hamkins; W. Hugh Woodin (Math. Log. Q., 2005)

Diamond (on the regulars) can fail at any strongly unfoldable cardinal. - Mirna Dzamonja; Joel David Hamkins (Ann. Pure Appl. Log., 2006)

The Halting Problem Is Decidable on a Set of Asymptotic Probability One. - Joel David Hamkins; Alexei Miasnikov (Notre Dame J. Formal Log., 2006)

The Complexity of Quickly ORM-Decidable Sets. - Joel David Hamkins; David Linetsky; Russell G. Miller (CiE, 2007)

Post's Problem for Ordinal Register Machines. - Joel David Hamkins; Russell G. Miller (CiE, 2007)

A Survey of Infinite Time Turing Machines. - Joel David Hamkins (MCU, 2007)

Changing the heights of automorphism towers by forcing with Souslin trees over L. - Gunter Fuchs; Joel David Hamkins (J. Symb. Log., 2008)

Some Second Order Set Theory. - Joel David Hamkins (ICLA, 2009)

Post's Problem for ordinal register machines: An explicit approach. - Joel David Hamkins; Russell G. Miller (Ann. Pure Appl. Log., 2009)

Degrees of rigidity for Souslin trees. - Gunter Fuchs; Joel David Hamkins (J. Symb. Log., 2009)

Tall cardinals. - Joel David Hamkins (Math. Log. Q., 2009)

A Natural Model of the Multiverse Axioms. - Victoria Gitman; Joel David Hamkins (Notre Dame J. Formal Log., 2010)

Indestructible Strong Unfoldability. - Joel David Hamkins; Thomas A. Johnstone (Notre Dame J. Formal Log., 2010)

Infinite Time Decidable Equivalence Relation Theory. - Samuel Coskey; Joel David Hamkins (Notre Dame J. Formal Log., 2011)

The Mate-in-n Problem of Infinite Chess Is Decidable. - Dan Brumleve; Joel David Hamkins; Philipp Schlicht (CiE, 2012)

Inner models with large cardinal features usually obtained by forcing. - Arthur W. Apter; Victoria Gitman; Joel David Hamkins (Arch. Math. Log., 2012)

Generalizations of the Kunen inconsistency. - Joel David Hamkins; Greg Kirmayer; Norman Lewis Perlmutter (Ann. Pure Appl. Log., 2012)

The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility. - Samuel Coskey; Joel David Hamkins; Russell G. Miller (Comput., 2012)

The rigid relation principle, a new weak choice principle. - Joel David Hamkins; Justin Palumbo (Math. Log. Q., 2012)

The Set-Theoretic Multiverse. - Joel David Hamkins (Rev. Symb. Log., 2012)

Moving Up and Down in the Generic Multiverse. - Joel David Hamkins; Benedikt Löwe (ICLA, 2013)

Every Countable Model of Set Theory embeds into its Own Constructible Universe. - Joel David Hamkins (J. Math. Log., 2013)

Pointwise definable models of set theory. - Joel David Hamkins; David Linetsky; Jonas Reitz (J. Symb. Log., 2013)

Resurrection axioms and uplifting cardinals. - Joel David Hamkins; Thomas A. Johnstone (Arch. Math. Log., 2014)

Transfinite Game Values in Infinite Chess. - C. D. A. Evans; Joel David Hamkins (Integers, 2014)

The least weakly compact cardinal can be unfoldable, weakly measurable and nearly θ-supercompact. - Brent Cody; Moti Gitik; Joel David Hamkins; Jason A. Schanker (Arch. Math. Log., 2015)

Large cardinals need not be large in HOD. - Yong Cheng; Sy-David Friedman; Joel David Hamkins (Ann. Pure Appl. Log., 2015)

Set-theoretic geology. - Gunter Fuchs; Joel David Hamkins; Jonas Reitz (Ann. Pure Appl. Log., 2015)

Is the Dream Solution of the Continuum Hypothesis Attainable? - Joel David Hamkins (Notre Dame J. Formal Log., 2015)

Superstrong and other large cardinals are never Laver indestructible. - Joan Bagaria; Joel David Hamkins; Konstantinos Tsaprounis; Toshimichi Usuba (Arch. Math. Log., 2016)

What is the theory without power set? - Victoria Gitman; Joel David Hamkins; Thomas A. Johnstone (Math. Log. Q., 2016)

Algebraicity and Implicit Definability in Set Theory. - Joel David Hamkins; Cole Leahy (Notre Dame J. Formal Log., 2016)

Computable Quotient Presentations of Models of Arithmetic and Set Theory. - Michal Tomasz Godziszewski; Joel David Hamkins (WoLLIC, 2017)

Strongly uplifting cardinals and the boldface resurrection axioms. - Joel David Hamkins; Thomas A. Johnstone (Arch. Math. Log., 2017)

A Position in Infinite Chess With Game Value ω4. - C. D. A. Evans; Joel David Hamkins; Norman Lewis Perlmutter (Integers, 2017)

Incomparable ω1-like models of set theory. - Gunter Fuchs; Victoria Gitman; Joel David Hamkins (Math. Log. Q., 2017)

Zfc Proves that the class of Ordinals is not Weakly Compact for Definable Classes. - Ali Enayat; Joel David Hamkins (J. Symb. Log., 2018)

Ehrenfeucht's Lemma in Set Theory. - Gunter Fuchs; Victoria Gitman; Joel David Hamkins (Notre Dame J. Formal Log., 2018)

A model of the generic Vopěnka principle in which the ordinals are not Mahlo. - Victoria Gitman; Joel David Hamkins (Arch. Math. Log., 2019)

Set-theoretic blockchains. - Miha E. Habic; Joel David Hamkins; Lukas Daniel Klausner; Jonathan Verner; Kameryn J. Williams (Arch. Math. Log., 2019)

The Implicitly Constructible Universe. - Marcia J. Groszek; Joel David Hamkins (J. Symb. Log., 2019)

When does every definable nonempty set have a definable element? - François G. Dorais; Joel David Hamkins (Math. Log. Q., 2019)

The exact strength of the class forcing Theorem. - Victoria Gitman; Joel David Hamkins; Peter Holy; Philipp Schlicht; Kameryn J. Williams (J. Symb. Log., 2020)

Inner-Model Reflection Principles. - Neil Barton; Andrés Eduardo Caicedo; Gunter Fuchs; Joel David Hamkins; Jonas Reitz; Ralf Schindler (Stud Logica, 2020)

Transfinite game values in infinite draughts. - Joel David Hamkins; Davide Leonessi (CoRR, 2021)

Bi-Interpretation in Weak Set Theories. - Alfredo Roque Freire; Joel David Hamkins (J. Symb. Log., 2021)

Infinite Hex is a draw. - Joel David Hamkins; Davide Leonessi (CoRR, 2022)

The σ1-Definable Universal finite sequence. - Joel David Hamkins; Kameryn J. Williams (J. Symb. Log., 2022)

Choiceless large cardinals and set-theoretic potentialism. - Raffaella Cutolo; Joel David Hamkins (Math. Log. Q., 2022)

The Modal Logic of Set-Theoretic Potentialism and the Potentialist Maximality Principles. - Joel David Hamkins; Øystein Linnebo (Rev. Symb. Log., 2022)

Infinite Wordle and the mastermind numbers. - Joel David Hamkins (Math. Log. Q., 2023)

Did Turing prove the undecidability of the halting problem? - Joel David Hamkins; Theodor Nenu (CoRR, 2024)

Reflection in second-order Set Theory with abundant urelements bi-interprets a Supercompact cardinal. - Joel David Hamkins; Bokai Yao (J. Symb. Log., 2024)