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
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01397294
Contributor : Benoit Monin <>
Submitted on : Tuesday, November 15, 2016 - 4:14:22 PM
Last modification on : Wednesday, December 19, 2018 - 3:50:03 PM
Document(s) archivé(s) le : Thursday, March 16, 2017 - 6:33:44 PM

File

tocs2016.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

85

Files downloads

50