Joel David Hamkins

79 papers C 6Journal 70Unranked 3

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