Parameter-free uniformisation

DOI10.1090/S0002-9939-08-09275-7zbMATH Open1145.03030OpenAlexW2047964762MaRDI QIDQ3522334FDOQ3522334

Authors Sy-David Friedman 

Publication date 1 September 2008

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0002-9939-08-09275-7

zbMATH Keywords

large cardinalsinner modelsdescriptive set theory

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Large cardinals (03E55) Turing machines and related notions (03D10) Inner models, including constructibility, ordinal definability, and core models (03E45)

Recommendations

• Infinite games and uniformization
• Infinite time Turing machines
• Hypermachines
• Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
• The recognizability strength of infinite time Turing machines with ordinal parameters

Cites Work

• Eventually infinite time Turing machine degrees: infinite time decidable reals
• Fine structure and class forcing
• The fine structure of the constructible hierarchy

Cited In (4)

• Hypermachines
• Weak systems of determinacy and arithmetical quasi-inductive definitions
• Determinacy and monotone inductive definitions
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems

This page was built for publication: Parameter-free uniformisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522334)