Descriptive set theoretical complexity of randomness notions

DOI10.4064/fm215-3-2zbMath1258.03063OpenAlexW1969244702MaRDI QIDQ3100576

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

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

Related Items (3)

Higher randomness and forcing with closed sets ⋮ Initial segment complexities of randomness notions ⋮ RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY

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