Philip D. Welch

66 papers C 7Journal 56Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Free subsets in internally approachable models. Arch. Math. Log. Philip D. Welch
2023	J	`jnl`	Asymmetric Cut and Choose Games. Bull. Symb. Log. Christopher Henney-Turner, Peter Holy, Philipp Schlicht, Philip D. Welch
2023	J	`jnl`	Generalisations of stationarity, closed and unboundedness, and of Jensen's □. Ann. Pure Appl. Log. H. Brickhill, Philip D. Welch
2023	J	`jnl`	When cardinals determine the power set: inner models and Härtig quantifier logic. Math. Log. Q. Jouko Väänänen, Philip D. Welch
2022	J	`jnl`	Closed and Unbounded Classes and the HäRtig Quantifier Model. J. Symb. Log. Philip D. Welch
2021	J	`jnl`	Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum-Shub-Smale machines. Comput. Philip D. Welch
2021	J	`jnl`	G J. Symb. Log. Juan P. Aguilera, Philip D. Welch
2021	J	`jnl`	Stably Measurable Cardinals. J. Symb. Log. Philip D. Welch
2020	J	`jnl`	Decision times of infinite computations. CoRR Merlin Carl, Philipp Schlicht, Philip D. Welch
2020	J	`jnl`	Some observations on Truth Hierarchies: a correction. Rev. Symb. Log. Philip D. Welch
2019	J	`jnl`	Games and Ramsey-like Cardinals. J. Symb. Log. Dan Saattrup Nielsen, Philip D. Welch
2019	C	`conf`	Higher Type Recursion for Transfinite Machine Theory. CiE Philip D. Welch
2019	J	`jnl`	Rethinking Revision. J. Philos. Log. Philip D. Welch
2018	J	`jnl`	Recognizable sets and Woodin cardinals: computation beyond the constructible universe. Ann. Pure Appl. Log. Merlin Carl, Philipp Schlicht, Philip D. Welch
2018	C	`conf`	Taming Koepke's Zoo. CiE Merlin Carl, Sabrina Ouazzani, Philip D. Welch
2018	J	`jnl`	The Ramified analytical Hierarchy using Extended Logics. Bull. Symb. Log. Philip D. Welch
2016	—	`ch.`	Turing Transcendent: Beyond the Event Horizon. The Once and Future Turing Philip D. Welch
2015	J	`jnl`	Introduction. Notre Dame J. Formal Log. Salvatore Florio, Øystein Linnebo, Sean Walsh, Philip D. Welch
2015	J	`jnl`	Large Cardinals, Inner Models, and Determinacy: An Introductory Overview. Notre Dame J. Formal Log. Philip D. Welch
2015	J	`jnl`	Local Club Condensation and L-Likeness. J. Symb. Log. Peter Holy, Philip D. Welch, Liuzhen Wu
2015	J	`jnl`	The Complexity of the Dependence Operator. J. Philos. Log. Philip D. Welch
2014	J	`jnl`	Discrete Transfinite Computation. CoRR Philip D. Welch
2014	J	`jnl`	Some observations on Truth Hierarchies. Rev. Symb. Log. Philip D. Welch
2014	—	`ch.`	Transfinite machine models. Turing's Legacy Philip D. Welch
2012	J	`jnl`	Revision Revisited. Rev. Symb. Log. Leon Horsten, Graham E. Leigh, Hannes Leitgeb, Philip D. Welch
2011	C	`conf`	A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0. CiE Peter Koepke, Philip D. Welch
2011	J	`jnl`	Determinacy in strong cardinal models. J. Symb. Log. Philip D. Welch
2011	J	`jnl`	Global square and mutual stationarity at the aleph Ann. Pure Appl. Log. Peter Koepke, Philip D. Welch
2011	J	`jnl`	Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties. Ann. Pure Appl. Log. I. Sharpe, Philip D. Welch
2011	J	`jnl`	Hypermachines. J. Symb. Log. Sy-David Friedman, Philip D. Welch
2011	J	`jnl`	Ramsey-like cardinals II. J. Symb. Log. Victoria Gitman, Philip D. Welch
2011	J	`jnl`	Truth, Logical Validity and Determinateness: a Commentary on field's Saving Truth from Paradox. Rev. Symb. Log. Philip D. Welch
2011	J	`jnl`	Weak systems of determinacy and arithmetical quasi-inductive definitions. J. Symb. Log. Philip D. Welch
2010	J	`jnl`	Book Reviews. Stud Logica Philip D. Welch
2009	J	`jnl`	Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems. Theor. Comput. Sci. Philip D. Welch
2009	J	`jnl`	Games for truth. Bull. Symb. Log. Philip D. Welch
2009	C	`conf`	Relativistic Computers and Transfinite Computation. UC Philip D. Welch
2009	J	`jnl`	The undecidability of propositional adaptive logic. Synth. Leon Horsten, Philip D. Welch
2008	J	`jnl`	Bounding lemmata for non-deterministic halting times of transfinite Turing machines. Theor. Comput. Sci. Philip D. Welch
2008	J	`jnl`	On the consistency strength of the inner model hypothesis. J. Symb. Log. Sy-David Friedman, Philip D. Welch, W. Hugh Woodin
2008	J	`jnl`	Ultimate Truth vis-à-vis stable Truth. Rev. Symb. Log. Philip D. Welch
2007	J	`jnl`	The Undecidability of Propositional Adaptive Logic. Synth. Leon Horsten, Philip D. Welch
2007	C	`conf`	Turing Unbound: Transfinite Computation. CiE Philip D. Welch
2006	C	`conf`	Non-deterministic Halting Times for Hamkins-Kidder Turing Machines. CiE Philip D. Welch
2005	J	`jnl`	Comparing Inductive and Circular Definitions: Parameters, Complexity and Games. Stud Logica Kai-Uwe Kühnberger, Benedikt Löwe, Michael Möllerfeld, Philip D. Welch
2005	J	`jnl`	Some Open Problems in Mutual Stationarity Involving Inner Model Theory: A Commentary. Notre Dame J. Formal Log. Philip D. Welch
2005	C	`conf`	The Transfinite Action of 1 Tape Turing Machines. CiE Philip D. Welch
2004	J	`jnl`	On unfoldable cardinals, omega-closed cardinals, and the beginning of the inner model hierarchy. Arch. Math. Log. Philip D. Welch
2003	J	`jnl`	On revision operators. J. Symb. Log. Philip D. Welch
2003	J	`jnl`	P Math. Log. Q. Joel David Hamkins, Philip D. Welch
2003	J	`jnl`	Possible-Worlds Semantics for Modal Notions Conceived as Predicates. J. Philos. Log. Volker Halbach, Hannes Leitgeb, Philip D. Welch
2002	J	`jnl`	Bounded Martin's Maximum, Weak Erdös Cardinals and psi J. Symb. Log. David Asperó, Philip D. Welch
2001	J	`jnl`	On Elementary Embeddings from An Inner Model to The Universe. J. Symb. Log. John M. Vickers, Philip D. Welch
2001	J	`jnl`	On Gupta-Belnap Revision Theories of Truth, Kripkean fixed points, and the next stable set. Bull. Symb. Log. Philip D. Welch
2001	—	`conf`	Post's and other problems of supertasks of higher type. FotFS Philip D. Welch
2001	J	`jnl`	Set-Theoretic Absoluteness and the Revision Theory of Truth. Stud Logica Benedikt Löwe, Philip D. Welch
2000	J	`jnl`	Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. J. Symb. Log. Philip D. Welch
2000	J	`jnl`	On successors of Jónsson cardinals. Arch. Math. Log. John M. Vickers, Philip D. Welch
1996	J	`jnl`	Countable Unions of Simple Sets in the Core Model. J. Symb. Log. Philip D. Welch
1996	J	`jnl`	Determinacy in the Difference Hierarchy of Co-Analytic Sets. Ann. Pure Appl. Log. Philip D. Welch
1994	J	`jnl`	Characterising Subsets of omega J. Symb. Log. Philip D. Welch
1988	J	`jnl`	Some descriptive set theory and core models. Ann. Pure Appl. Log. Philip D. Welch
1987	J	`jnl`	Minimality in the \triangle J. Symb. Log. Philip D. Welch
1987	J	`jnl`	The Reals in Core Models. J. Symb. Log. Philip D. Welch
1986	J	`jnl`	The Natural Hierarchy and Quasi-Hierarchy of Constructibility Degrees. J. Symb. Log. Philip D. Welch
1985	J	`jnl`	Comparing Incomparable Kleene Degrees. J. Symb. Log. Philip D. Welch