Philip D. Welch

According to our database, Philip D. Welch authored at least 64 papers between 1985 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Asymmetric Cut and Choose Games.

Christopher Henney-Turner, Peter Holy, Philipp Schlicht, Philip D. Welch

Bull. Symb. Log., December, 2023

When cardinals determine the power set: inner models and Härtig quantifier logic.

Jouko Väänänen, Philip D. Welch

Math. Log. Q., November, 2023

Generalisations of stationarity, closed and unboundedness, and of Jensen's □.

H. Brickhill, Philip D. Welch

Ann. Pure Appl. Log., July, 2023

2022

Closed and Unbounded Classes and the HäRtig Quantifier Model.

Philip D. Welch

J. Symb. Log., 2022

2021

Stably Measurable Cardinals.

Philip D. Welch

J. Symb. Log., 2021

G_δσ GAMES AND INDUCTION ON REALS.

Juan P. Aguilera, Philip D. Welch

J. Symb. Log., 2021

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

Philip D. Welch

Comput., 2021

2020

Some observations on Truth Hierarchies: a correction.

Philip D. Welch

Rev. Symb. Log., 2020

Decision times of infinite computations.

Merlin Carl, Philipp Schlicht, Philip D. Welch

CoRR, 2020

2019

Games and Ramsey-like Cardinals.

Dan Saattrup Nielsen, Philip D. Welch

J. Symb. Log., 2019

Rethinking Revision.

Philip D. Welch

J. Philos. Log., 2019

Higher Type Recursion for Transfinite Machine Theory.

Philip D. Welch

Proceedings of the Computing with Foresight and Industry, 2019

2018

The Ramified analytical Hierarchy using Extended Logics.

Philip D. Welch

Bull. Symb. Log., 2018

Recognizable sets and Woodin cardinals: computation beyond the constructible universe.

Merlin Carl, Philipp Schlicht, Philip D. Welch

Ann. Pure Appl. Log., 2018

Taming Koepke's Zoo.

Merlin Carl, Sabrina Ouazzani, Philip D. Welch

Proceedings of the Sailing Routes in the World of Computation, 2018

2016

Turing Transcendent: Beyond the Event Horizon.

Philip D. Welch

Proceedings of the Once and Future Turing: Computing the World, 2016

2015

Large Cardinals, Inner Models, and Determinacy: An Introductory Overview.

Philip D. Welch

Notre Dame J. Formal Log., 2015

Introduction.

Salvatore Florio, Øystein Linnebo, Sean Walsh, Philip D. Welch

Notre Dame J. Formal Log., 2015

Local Club Condensation and L-Likeness.

Peter Holy, Philip D. Welch, Liuzhen Wu

J. Symb. Log., 2015

The Complexity of the Dependence Operator.

Philip D. Welch

J. Philos. Log., 2015

2014

Some observations on Truth Hierarchies.

Philip D. Welch

Rev. Symb. Log., 2014

Discrete Transfinite Computation.

Philip D. Welch

CoRR, 2014

Transfinite machine models.

Philip D. Welch

Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2012

Revision Revisited.

Leon Horsten, Graham E. Leigh, Hannes Leitgeb, Philip D. Welch

Rev. Symb. Log., 2012

2011

Truth, Logical Validity and Determinateness: a Commentary on field's Saving Truth from Paradox.

Philip D. Welch

Rev. Symb. Log., 2011

Determinacy in strong cardinal models.

Philip D. Welch

J. Symb. Log., 2011

Weak systems of determinacy and arithmetical quasi-inductive definitions.

Philip D. Welch

J. Symb. Log., 2011

Ramsey-like cardinals II.

Victoria Gitman, Philip D. Welch

J. Symb. Log., 2011

Hypermachines.

Sy-David Friedman, Philip D. Welch

J. Symb. Log., 2011

Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties.

I. Sharpe, Philip D. Welch

Ann. Pure Appl. Log., 2011

Global square and mutual stationarity at the aleph_n.

Peter Koepke, Philip D. Welch

Ann. Pure Appl. Log., 2011

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

Peter Koepke, Philip D. Welch

Proceedings of the Models of Computation in Context, 2011

2010

Book Reviews.

Philip D. Welch

Stud Logica, 2010

2009

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

Philip D. Welch

Theor. Comput. Sci., 2009

Games for truth.

Philip D. Welch

Bull. Symb. Log., 2009

Relativistic Computers and Transfinite Computation.

Philip D. Welch

Proceedings of the Unconventional Computation, 8th International Conference, 2009

2008

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

Philip D. Welch

Theor. Comput. Sci., 2008

Ultimate Truth vis-à-vis stable Truth.

Philip D. Welch

Rev. Symb. Log., 2008

On the consistency strength of the inner model hypothesis.

Sy-David Friedman, Philip D. Welch, W. Hugh Woodin

J. Symb. Log., 2008

2007

The Undecidability of Propositional Adaptive Logic.

Leon Horsten, Philip D. Welch

Synth., 2007

Turing Unbound: Transfinite Computation.

Philip D. Welch

Proceedings of the Computation and Logic in the Real World, 2007

2006

Non-deterministic Halting Times for Hamkins-Kidder Turing Machines.

Philip D. Welch

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Comparing Inductive and Circular Definitions: Parameters, Complexity and Games.

Kai-Uwe Kühnberger, Benedikt Löwe, Michael Möllerfeld, Philip D. Welch

Stud Logica, 2005

Some Open Problems in Mutual Stationarity Involving Inner Model Theory: A Commentary.

Philip D. Welch

Notre Dame J. Formal Log., 2005

The Transfinite Action of 1 Tape Turing Machines.

Philip D. Welch

Proceedings of the New Computational Paradigms, 2005

2004

On unfoldable cardinals, omega-closed cardinals, and the beginning of the inner model hierarchy.

Philip D. Welch

Arch. Math. Log., 2004

2003

P^f != NP^f for almost all f.

Joel David Hamkins, Philip D. Welch

Math. Log. Q., 2003

On revision operators.

Philip D. Welch

J. Symb. Log., 2003

Possible-Worlds Semantics for Modal Notions Conceived as Predicates.

Volker Halbach, Hannes Leitgeb, Philip D. Welch

J. Philos. Log., 2003

2002

Bounded Martin's Maximum, Weak Erdös Cardinals and psi _AC.

David Asperó, Philip D. Welch

J. Symb. Log., 2002

2001

Set-Theoretic Absoluteness and the Revision Theory of Truth.

Benedikt Löwe, Philip D. Welch

Stud Logica, 2001

On Elementary Embeddings from An Inner Model to The Universe.

John M. Vickers, Philip D. Welch

J. Symb. Log., 2001

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

Philip D. Welch

Bull. Symb. Log., 2001

Post's and other problems of supertasks of higher type.

Philip D. Welch

Proceedings of the Classical and New Paradigms of Computation and their Complexity Hierarchies, 2001

2000

Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals.

Philip D. Welch

J. Symb. Log., 2000

On successors of Jónsson cardinals.

John M. Vickers, Philip D. Welch

Arch. Math. Log., 2000

1996

Countable Unions of Simple Sets in the Core Model.

Philip D. Welch

J. Symb. Log., 1996

Determinacy in the Difference Hierarchy of Co-Analytic Sets.

Philip D. Welch

Ann. Pure Appl. Log., 1996

1994

Characterising Subsets of omega₁ Constructible from a Real.

Philip D. Welch

J. Symb. Log., 1994

1988

Some descriptive set theory and core models.

Philip D. Welch

Ann. Pure Appl. Log., 1988

1987

Minimality in the \triangle¹₃-Degrees.

Philip D. Welch

J. Symb. Log., 1987

The Reals in Core Models.

Philip D. Welch

J. Symb. Log., 1987

1986

The Natural Hierarchy and Quasi-Hierarchy of Constructibility Degrees.

Philip D. Welch

J. Symb. Log., 1986

1985

Comparing Incomparable Kleene Degrees.

Philip D. Welch

J. Symb. Log., 1985