The following pages link to Philip D. Welch (Q221561):
Displaying 50 items.
- (Q354133) (redirect page) (← links)
- The aftermath (Q354134) (← links)
- (Q639678) (redirect page) (← links)
- Global square and mutual stationarity at the \(\aleph_n\) (Q639679) (← links)
- Comparing inductive and circular definitions: Parameters, complexity and games (Q817681) (← links)
- Erratum to ``The undecidability of propositional adaptive logic'' (Q1036053) (← links)
- Lower consistency bounds for mutual stationarity with divergent uncountable cofinalities (Q1618105) (← links)
- Taming Koepke's zoo (Q1670732) (← links)
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811) (← links)
- Possible-worlds semantics for modal notions conceived as predicates (Q1810820) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- Higher type recursion for transfinite machine theory (Q2179350) (← links)
- The undecidability of propositional adaptive logic (Q2460176) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- LOCAL CLUB CONDENSATION AND L-LIKENESS (Q2795923) (← links)
- (Q2803847) (← links)
- Discrete Transfinite Computation (Q2906573) (← links)
- Hypermachines (Q3011123) (← links)
- The natural hierarchy and quasi-hierarchy of constructibility degrees (Q3026997) (← links)
- Σ* Fine Structure (Q3053897) (← links)
- A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0 (Q3091451) (← links)
- Relativistic Computers and Transfinite Computation (Q3184755) (← links)
- SOME OBSERVATIONS ON TRUTH HIERARCHIES: A CORRECTION (Q3389496) (← links)
- (Q3425068) (← links)
- On the consistency strength of the inner model hypothesis (Q3503744) (← links)
- (Q3691660) (← links)
- Comparing incomparable kleene degrees (Q3708791) (← links)
- The reals in core models (Q3760539) (← links)
- Minimality in the <i>Δ</i>⅓-degrees (Q3788001) (← links)
- Pf ≠ NPf for almost all f (Q4434508) (← links)
- GAMES AND RAMSEY-LIKE CARDINALS (Q4628691) (← links)
- (Q4689311) (← links)
- Bounded Martin's Maximum, weak Erdӧs cardinals, and <i>ψ</i><sub><i>Ac</i></sub> (Q4779656) (← links)
- REVISION REVISITED (Q4899963) (← links)
- (Q4934571) (← links)
- (Q4944928) (← links)
- THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS (Q4961868) (← links)
- Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines (Q4995609) (← links)
- CLOSED AND UNBOUNDED CLASSES AND THE HÄRTIG QUANTIFIER MODEL (Q5082056) (← links)
- STABLY MEASURABLE CARDINALS (Q5159484) (← links)
- Turing Unbound: Transfinite Computation (Q5425382) (← links)
- (Q5711928) (← links)
- New Computational Paradigms (Q5717085) (← links)
- Set-theoretic absoluteness and the revision theory of truth (Q5951910) (← links)
- When cardinals determine the power set: inner models and Härtig quantifier logic (Q6140754) (← links)
- ASYMMETRIC CUT AND CHOOSE GAMES (Q6199175) (← links)
- The Ramified Analytical Hierarchy using Extended Logics (Q6305305) (← links)
- Stably Measurable Cardinals (Q6312576) (← links)
- Closed Unbounded classes and the Haertig Quantifier Model (Q6315185) (← links)
- Determinacy and \Delta^1_3-degrees (Q6503640) (← links)
