| 2009 |
|---|
| 26 | EE | Joel David Hamkins:
Some Second Order Set Theory.
ICLA 2009: 36-50 |
| 2007 |
|---|
| 25 | EE | Joel David Hamkins,
Russell G. Miller:
Post's Problem for Ordinal Register Machines.
CiE 2007: 358-367 |
| 24 | EE | Joel David Hamkins,
David Linetsky,
Russell Miller:
The Complexity of Quickly ORM-Decidable Sets.
CiE 2007: 488-496 |
| 23 | EE | Joel David Hamkins:
A Survey of Infinite Time Turing Machines.
MCU 2007: 62-71 |
| 2006 |
|---|
| 22 | EE | 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) |
| 2005 |
|---|
| 21 | EE | Joel David Hamkins:
Infinitary Computability with Infinite Time Turing Machines.
CiE 2005: 180-187 |
| 20 | EE | 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 | EE | 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 | EE | Joel David Hamkins,
Philip D. Welch:
Pf != NPf for almost all f.
Math. Log. Q. 49(5): 536-540 (2003) |
| 2002 |
|---|
| 15 | EE | 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 | EE | 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 | EE | Joel David Hamkins,
Daniel Evan Seabold:
Infinite Time Turing Machines With Only One Tape.
Math. Log. Q. 47(2): 271-287 (2001) |
| 10 | EE | 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 | EE | 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) |
