Higher randomness and forcing with closed sets

DOI10.4230/LIPICS.STACS.2014.566zbMATH Open1359.03037OpenAlexW2277435525MaRDI QIDQ2965517FDOQ2965517

Authors: Benoit Monin 

Publication date: 3 March 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2014.566

Recommendations

• Higher randomness and forcing with closed sets
• Effective strong nullness and effectively closed sets
• Randomness via effective descriptive set theory
• \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets
• On effectively closed sets of effective strong measure zero

zbMATH Keywords

genericityeffective descriptive set theoryeffective randomnesshigher computability

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Theory of numerations, effectively presented structures (03D45) Descriptive set theory (03E15)

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective strong nullness and effectively closed sets
• Higher randomness and forcing with closed sets
• Higher randomness and genericity
• Genericity and randomness with ITTMs
• The weakness of the pigeonhole principle under hyperarithmetical reductions
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• Continuous higher randomness

This page was built for publication: Higher randomness and forcing with closed sets

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