Higher randomness and lim-sup forcing within and beyond hyperarithmetic

DOI10.1142/9789813223523_0006MaRDI QIDQ5137318zbMATH OpenOpenAlexFDO

Authors Takayuki Kihara

Publication date 2 December 2020

Published in Sets and Computations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789813223523_0006

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Algorithmic randomness and dimension (03D32) Higher-type and set recursion theory (03D65) Other aspects of forcing and Boolean-valued models (03E40) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Higher randomness and genericity
• Randomness in the higher setting
• Continuous higher randomness
• Forcing and reducibilities. III. Forcing in fragments of set theory
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY

Cited in

(3)

• Higher randomness and genericity
• Computability of Subsets of Metric Spaces
• The Cichoń diagram for degrees of relative constructibility

This page was built for publication: Higher randomness and lim-sup forcing within and beyond hyperarithmetic

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