Joel David Hamkins

	2012
37		Dan Brumleve, Joel David Hamkins, Philipp Schlicht: The Mate-in-n Problem of Infinite Chess Is Decidable. CiE 2012: 78-88
36		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)
35		Dan Brumleve, Joel David Hamkins, Philipp Schlicht: The mate-in-n problem of infinite chess is decidable CoRR abs/1201.5597: (2012)
	2011
34		Samuel Coskey, Joel David Hamkins: Infinite Time Decidable Equivalence Relation Theory. Notre Dame Journal of Formal Logic 52(2): 203-228 (2011)
	2010
33		Joel David Hamkins, Thomas A. Johnstone: Indestructible Strong Unfoldability. Notre Dame Journal of Formal Logic 51(3): 291-321 (2010)
32		Victoria Gitman, Joel David Hamkins: A Natural Model of the Multiverse Axioms. Notre Dame Journal of Formal Logic 51(4): 475-484 (2010)
	2009
31		Joel David Hamkins: Some Second Order Set Theory. ICLA 2009: 36-50
30		Joel David Hamkins, Russell G. Miller: Post's Problem for ordinal register machines: An explicit approach. Ann. Pure Appl. Logic 160(3): 302-309 (2009)
29		Gunter Fuchs, Joel David Hamkins: Degrees of rigidity for Souslin trees. J. Symb. Log. 74(2): 423-454 (2009)
28		Joel David Hamkins: Tall cardinals. Math. Log. Q. 55(1): 68-86 (2009)
	2008
27		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
26		Joel David Hamkins, Russell G. Miller: Post's Problem for Ordinal Register Machines. CiE 2007: 358-367
25		Joel David Hamkins, David Linetsky, Russell G. Miller: The Complexity of Quickly ORM-Decidable Sets. CiE 2007: 488-496
24		Joel David Hamkins: A Survey of Infinite Time Turing Machines. MCU 2007: 62-71
	2006
23		Mirna Dzamonja, Joel David Hamkins: Diamond (on the regulars) can fail at any strongly unfoldable cardinal. Ann. Pure Appl. Logic 144(1-3): 83-95 (2006)
22		Joel David Hamkins, Alexei Miasnikov: The Halting Problem Is Decidable on a Set of Asymptotic Probability One. Notre Dame Journal of Formal Logic 47(4): 515-524 (2006)
	2005
21		Joel David Hamkins: Infinitary Computability with Infinite Time Turing Machines. CiE 2005: 180-187
20		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)
19		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)
	2003
18		Joel David Hamkins: A simple maximality principle. J. Symb. Log. 68(2): 527-550 (2003)
17		Arthur W. Apter, Joel David Hamkins: Exactly controlling the non-supercompact strongly compact cardinals. J. Symb. Log. 68(2): 669-688 (2003)
16		Joel David Hamkins, Philip D. Welch: Pf != NPf for almost all f. Math. Log. Q. 49(5): 536-540 (2003)
	2002
15		Joel David Hamkins, Andrew Lewis: Post's problem for supertasks has both positive and negative solutions. Arch. Math. Log. 41(6): 507-523 (2002)
14		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
13		Joel David Hamkins: The Wholeness Axioms and V=HOD. Arch. Math. Log. 40(1): 1-8 (2001)
12		Joel David Hamkins: Unfoldable Cardinals and The GCH. J. Symb. Log. 66(3): 1186-1198 (2001)
11		Joel David Hamkins, Daniel Evan Seabold: Infinite Time Turing Machines With Only One Tape. Math. Log. Q. 47(2): 271-287 (2001)
10		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
9		Joel David Hamkins: The Lottery Preparation. Ann. Pure Appl. Logic 101(2-3): 103-146 (2000)
8		Joel David Hamkins, Simon Thomas: Changing the Heights of Automorphism Towers. Ann. Pure Appl. Logic 102(1-2): 139-157 (2000)
7		Joel David Hamkins, Andy Lewis: Infinite Time Turing Machines. J. Symb. Log. 65(2): 567-604 (2000)
	1999
6		Joel David Hamkins: Gap forcing: Generalizing the Lévy-Solovay theorem. Bulletin of Symbolic Logic 5(2): 264-272 (1999)
	1998
5		Joel David Hamkins: Destruction or Preservation as You Like It. Ann. Pure Appl. Logic 91(2-3): 191-229 (1998)
4		Joel David Hamkins: Small Forcing Makes Any Cardinal Superdestructable. J. Symb. Log. 63(1): 51-58 (1998)
3		Joel David Hamkins, Saharon Shelah: Superdestructibility: A Dual to Laver's Indestructibility. J. Symb. Log. 63(2): 549-554 (1998)
	1997
2		Joel David Hamkins: Canonical Seeds and Prikiry Trees. J. Symb. Log. 62(2): 373-396 (1997)
	1994
1		Joel David Hamkins: Fragile Measurability. J. Symb. Log. 59(1): 262-282 (1994)

Coauthor Index

1	Arthur W. Apter	[10] [14] [17] [36]
2	Dan Brumleve	[35] [37]
3	Samuel Coskey	[34]
4	Vinay Deolalikar	[20]
5	Mirna Dzamonja	[23]
6	Gunter Fuchs	[27] [29]
7	Victoria Gitman	[32] [36]
8	Thomas A. Johnstone	[33]
9	Andrew Lewis	[15]
10	Andy Lewis	[7]
11	David Linetsky	[25]
12	Alexei Miasnikov	[22]
13	Russell G. Miller	[25] [26] [30]
14	Ralf Schindler	[20]
15	Philipp Schlicht	[35] [37]
16	Daniel Evan Seabold	[11]
17	Saharon Shelah	[3]
18	Simon Thomas	[8]
19	Philip D. Welch	[16]
20	W. Hugh Woodin	[19]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page