Hypermachines
From MaRDI portal
Publication:3011123
DOI10.2178/jsl/1305810767zbMath1220.03040OpenAlexW4233914677MaRDI QIDQ3011123
Philip D. Welch, Sy-David Friedman
Publication date: 28 June 2011
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1305810767
Inner models, including constructibility, ordinal definability, and core models (03E45) Turing machines and related notions (03D10) Higher-type and set recursion theory (03D65)
Related Items
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY, Discrete Transfinite Computation, Recognizable sets and Woodin cardinals: computation beyond the constructible universe, Determinacy in strong cardinal models, Unnamed Item, Taming Koepke's zoo. II: Register machines, Clockability for ordinal Turing machines
Cites Work
- Unnamed Item
- Unnamed Item
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
- Descriptive set theory
- Fine structure and class forcing
- Provinces of logic determined. Essays in the memory of Alfred Tarski. Part I, II, III
- Parameter-free uniformisation
- Eventually infinite time Turing machine degrees: infinite time decidable reals
- The fine structure of the constructible hierarchy
