| 2009 |
| 22 | EE | Philip D. Welch:
Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems.
Theor. Comput. Sci. 410(4-5): 426-442 (2009) |
| 2008 |
| 21 | EE | Philip D. Welch:
Bounding lemmata for non-deterministic halting times of transfinite Turing machines.
Theor. Comput. Sci. 394(3): 223-228 (2008) |
| 2007 |
| 20 | EE | Philip D. Welch:
Turing Unbound: Transfinite Computation.
CiE 2007: 768-780 |
| 2006 |
| 19 | EE | Philip D. Welch:
Non-deterministic Halting Times for Hamkins-Kidder Turing Machines.
CiE 2006: 571-574 |
| 2005 |
| 18 | EE | Philip D. Welch:
The Transfinite Action of 1 Tape Turing Machines.
CiE 2005: 532-539 |
| 17 | EE | Kai-Uwe Kühnberger,
Benedikt Löwe,
Michael Möllerfeld,
Philip D. Welch:
Comparing Inductive and Circular Definitions: Parameters, Complexity and Games.
Studia Logica 81(1): 79-98 (2005) |
| 2004 |
| 16 | EE | Philip D. Welch:
On unfoldable cardinals, omega-closed cardinals, and the beginning of the inner model hierarchy.
Arch. Math. Log. 43(4): 443-458 (2004) |
| 2003 |
| 15 | | Philip D. Welch:
On revision operators.
J. Symb. Log. 68(2): 689-711 (2003) |
| 14 | EE | Joel David Hamkins,
Philip D. Welch:
Pf != NPf for almost all f.
Math. Log. Q. 49(5): 536-540 (2003) |
| 2002 |
| 13 | | David Asperó,
Philip D. Welch:
Bounded Martin's Maximum, Weak Erdös Cardinals and psi AC.
J. Symb. Log. 67(3): 1141-1152 (2002) |
| 2001 |
| 12 | EE | Philip D. Welch:
On Gupta-Belnap Revision Theories of Truth, Kripkean fixed points, and the next stable set.
Bulletin of Symbolic Logic 7(3): 345-360 (2001) |
| 11 | | J. Vickers,
Philip D. Welch:
On Elementary Embeddings from An Inner Model to The Universe.
J. Symb. Log. 66(3): 1090-1116 (2001) |
| 10 | | Benedikt Löwe,
Philip D. Welch:
Set-Theoretic Absoluteness and the Revision Theory of Truth.
Studia Logica 68(1): 21-41 (2001) |
| 2000 |
| 9 | EE | J. Vickers,
Philip D. Welch:
On successors of Jónsson cardinals.
Arch. Math. Log. 39(6): 465-473 (2000) |
| 8 | | Philip D. Welch:
Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals.
J. Symb. Log. 65(3): 1193-1203 (2000) |
| 1996 |
| 7 | | Philip D. Welch:
Determinacy in the Difference Hierarchy of Co-Analytic Sets.
Ann. Pure Appl. Logic 80(1): 69-108 (1996) |
| 6 | | Philip D. Welch:
Countable Unions of Simple Sets in the Core Model.
J. Symb. Log. 61(1): 293-312 (1996) |
| 1994 |
| 5 | | Philip D. Welch:
Characterising Subsets of omega1 Constructible from a Real.
J. Symb. Log. 59(4): 1420-1432 (1994) |
| 1987 |
| 4 | | Philip D. Welch:
The Reals in Core Models.
J. Symb. Log. 52(1): 64-67 (1987) |
| 3 | | Philip D. Welch:
Minimality in the \triangle13-Degrees.
J. Symb. Log. 52(4): 908-915 (1987) |
| 1986 |
| 2 | | Philip D. Welch:
The Natural Hierarchy and Quasi-Hierarchy of Constructibility Degrees.
J. Symb. Log. 51(1): 130-134 (1986) |
| 1985 |
| 1 | | Philip D. Welch:
Comparing Incomparable Kleene Degrees.
J. Symb. Log. 50(1): 55-58 (1985) |