Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Higher Randomness and Forcing with Closed Sets

Abstract : Kechris showed in [9] that there exists a largest Π11 set of measure 0. Due to its universal nature, it was conjectured by many that this nullset has a high Borel rank. In this paper, we refute this conjecture and show that this nullset is merely Σ03. Together with a result of Liang Yu, our result also implies that the exact Borel complexity of this set is Σ03. To do this proof, we develop the machinery of effective randomness and effective Solovay genericity, investigating the connections between those notions and effective domination properties.
Document type :
Journal articles
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Benoit MONIN Connect in order to contact the contributor
Submitted on : Tuesday, November 15, 2016 - 4:14:22 PM
Last modification on : Wednesday, November 3, 2021 - 5:39:12 AM
Long-term archiving on: : Thursday, March 16, 2017 - 6:33:44 PM


Files produced by the author(s)




Benoit Monin. Higher Randomness and Forcing with Closed Sets. Theory of Computing Systems, Springer Verlag, 2016, ⟨10.1007/s00224-016-9681-5⟩. ⟨hal-01397294⟩



Record views


Files downloads