Descriptive set theoretical complexity of randomness notions

DOI10.4064/FM215-3-2MaRDI QIDQ3100576zbMATH OpenOpenAlexFDO

Authors Liang Yu

Publication date 24 November 2011

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4064/fm215-3-2

zbMATH Keywords

forcingrandomness

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)

Cited in

(4)

• Initial segment complexities of randomness notions
• Higher randomness and forcing with closed sets
• Some descriptive-set-theoretical problems in complexity theory
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY

This page was built for publication: Descriptive set theoretical complexity of randomness notions

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