P. Welch

发表

On the Possibility, or Otherwise, of Hypercomputation

Philip D. Welch, P. Welch, 2004, The British Journal for the Philosophy of Science.

Erratum: The Undecidability of Propositional Adaptive Logic

L. Horsten, P. Welch, 2009 .

Generalisations of Stationarity, Closed and Unboundedness, and of Jensen's $\Box$

P. Welch, H. Brickhill, 2019, 1908.05920.

Turing's Mathematical Work

P. Welch, 2013 .

Gδσ-games and generalized computation

P. Welch, 2015 .

G_{\delta \sigma}-games and generalized computation

P. Welch, 2015, 1509.09135.

P^f is not equal to NP^f for almost all f

J. Hamkins, P. Welch, 2002, math/0212046.

Post's and other problems in higher type supertasks

Philip D. Welch, P. Welch, 2004 .

Field on revenge

Agustín Rayo, P. Welch, 2007 .

Contemporary Mathematics Obtaining Woodin ’ s Cardinals

P. Welch, 2017 .

Obtaining Woodin's cardinals

P. Welch, 2017 .

Absolute Infinity ∗

L. Horsten, P. Welch, 2012 .

FORCING A MUTUAL STATIONARITY PROPERTY IN COFINALITY ω1

P. Koepke, J. Cummings, P. Koepke, 2007 .

Lower consistency bounds for mutual stationarity with divergent uncountable cofinalities

Sean D. Cox, P. Welch, D. Adolf, 2016, Israel Journal of Mathematics.

Global Square and Mutual Stationarity at the א

P. Koepke, P. Welch, 2011 .

STABLY MEASURABLE CARDINALS

P. Welch, 2019, The Journal of Symbolic Logic.

Closed Unbounded classes and the Haertig Quantifier Model

P. Welch, 2019, 1903.02663.

Conceptual realism : sets and classes

P. Welch, 2016 .

Characterising subsets of Ω 1 constructible from a real

P. D. Welch, P. Welch, 1994 .

Decision times of infinite computations pdf

Philipp Schlicht, Merlin Carl, Philip Welch, 2020, ArXiv.

The Extent of Computation in Malament–Hogarth Spacetimes

P. Welch, 2006, The British Journal for the Philosophy of Science.

SOME OBSERVATIONS ON TRUTH HIERARCHIES: A CORRECTION

P. Welch, 2020, The Review of Symbolic Logic.

Hypermachines

S. Friedman, P. Welch, 2011, The Journal of Symbolic Logic.

Countable ranks at the first and second projective levels

Philipp Schlicht, Merlin Carl, P. Welch, 2022, 2207.08754.

Weak systems of determinacy and arithmetical quasi-inductive definitions

P. Welch, 2009, J. Symb. Log..

Asymmetric cut and choose games

Philipp Schlicht, P. Welch, P. Holy, 2022, 2207.09199.

CLOSED AND UNBOUNDED CLASSES AND THE HÄRTIG QUANTIFIER MODEL

P. Welch, 2021, The Journal of Symbolic Logic.

(2018). Recognizable sets and Woodin cardinals: computation beyond the constructible universe. Annals of Pure and Applied Logic , 169 (4), 312-332.

Philipp Schlicht, P. Welch, 2017 .

Determinacy and 1 3 -degrees

P. Welch, 1996 .

Determinacy and ∆

P. Welch, 1996 .

Lower consistency bounds for mutual stationarity with divergent uncountable cofinalities

P. Welch, D. Adolf, Sean Cox, 2018, Israel Journal of Mathematics.

MULTIPLE FORCING (Cambridge Tracts in Mathematics 88)

P. Welch, 1989 .

Σ * Fine Structure

Philip D. Welch, P. Welch, 2010 .

Possible-Worlds Semantics for Modal Notions Conceived as Predicates

Philip D. Welch, Hannes Leitgeb, Volker Halbach, 2003, J. Philos. Log..

Recognizable sets and Woodin cardinals: computation beyond the constructible universe

Philipp Schlicht, Philip D. Welch, Merlin Carl, 2015, Ann. Pure Appl. Log..

Necessities and Necessary Truths: A Prolegomenon to the Use of Modal Logic in the Analysis of Intensional Notions

Volker Halbach, Philip Welch, P. Welch, 2009 .

Comparing Inductive and Circular Definitions: Parameters, Complexity and Games

Kai-Uwe Kühnberger, Benedikt Löwe, Philip D. Welch, 2005, Stud Logica.

On revision operators

Philip D. Welch, P. Welch, 2003, Journal of Symbolic Logic.

On Gupta-Belnap Revision Theories of Truth, Kripkean fixed points, and the next stable set

Philip D. Welch, P. Welch, 2001, Bull. Symb. Log..

Set-Theoretic Absoluteness and the Revision Theory of Truth

Benedikt Löwe, Philip D. Welch, B. Löwe, 2001, Stud Logica.

SOME OBSERVATIONS ON TRUTH HIERARCHIES

Philip D. Welch, P. Welch, 2014, The Review of Symbolic Logic.

REVISION REVISITED

Philip D. Welch, Hannes Leitgeb, Graham Emil Leigh, 2012, The Review of Symbolic Logic.

Games for Truth

Philip D. Welch, P. Welch, 2009, The Bulletin of Symbolic Logic.

ULTIMATE TRUTH VIS-À-VIS STABLE TRUTH

Philip D. Welch, P. Welch, 2008, The Review of Symbolic Logic.

Eventually infinite time Turing machine degrees: infinite time decidable reals

Philip D. Welch, P. Welch, 2000, Journal of Symbolic Logic.

A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0

Philip D. Welch, Peter Koepke, P. Koepke, 2011, CiE.

Discrete Transfinite Computation Models

Philip D. Welch, P. Welch, 2011 .

Transfinite machine models

P. D. Welch, P. Welch, 2014, Turing's Legacy.

A Generalised Dynamical System, Infinite Time

P. Koepke, P. Welch, 2011 .

Decision times of infinite computations

Philipp Schlicht, P. Welch, M. Carl, 2020, ArXiv.

Taming Koepke's Zoo

Philip D. Welch, Merlin Carl, Sabrina Ouazzani, 2018, CiE.

The Transfinite Action of 1 Tape Turing Machines

Philip D. Welch, P. Welch, 2005, CiE.

Pf ≠ NPf for almost all f

Joel David Hamkins, Philip D. Welch, J. Hamkins, 2003, Math. Log. Q..

P f �= NP f for almost all f

P. D. Welch, J. Hamkins, P. Welch, 2008 .

Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems

Philip D. Welch, P. Welch, 2009, Theor. Comput. Sci..

Discrete Transfinite Computation pdf

Philip D. Welch, P. Welch, 2014, ArXiv.

Turing Unbound: Transfinite Computation

Philip D. Welch, P. Welch, 2007, CiE.

Post's and other problems of supertasks of higher type

Philip D. Welch, P. Welch, 2001, FotFS.

Discrete Transfinite Computation

T., P. Welch, G. Sommaruga, 2014, ArXiv.

Proving Theorems from Reflection

Philip D. Welch, P. Welch, 2019, Synthese Library.

The Aftermath

L. Horsten, P. Welch, 2013, The Mathematical Intelligencer.

Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum-Shub-Smale machines

Philip Welch, P. Welch, 2020, Comput..

Higher Type Recursion for Transfinite Machine Theory

Philip Welch, P. Welch, 2019, CiE.

Bounding lemmata for non-deterministic halting times of transfinite Turing machines

Philip D. Welch, P. Welch, 2008, Theor. Comput. Sci..

Non-deterministic Halting Times for Hamkins-Kidder Turing Machines

Philip D. Welch, P. Welch, 2006, CiE.

Determinacy in the Difference Hierarchy of Co-Analytic Sets

Philip D. Welch, P. Welch, 1996, Ann. Pure Appl. Log..

On elementary embeddings from an inner model to the universe

Philip D. Welch, John M. Vickers, P. Welch, 2001, Journal of Symbolic Logic.

The Modern Corporation Statement on Economics

Grahame F. Thompson, Neil M. Lancastle, C. May, 2016 .

Coding the Universe: Some further applications

Philip D. Welch, R. Jensen, P. Welch, 1982 .

G Δσ -games

P. Welch, 2022 .

The Ramified analytical Hierarchy using Extended Logics

Philip Welch, P. Welch, 2018, Bull. Symb. Log..

Asymmetric cut and choose games

Philipp Schlicht, P. Welch, P. Holy, 2022, 2207.09199.