Descriptive set theoretical complexity of randomness notions

Liang Yu

Fundamenta Mathematicae (2011)

  • Volume: 215, Issue: 3, page 219-231
  • ISSN: 0016-2736

Abstract

top
We study the descriptive set theoretical complexity of various randomness notions.

How to cite

top

Liang Yu. "Descriptive set theoretical complexity of randomness notions." Fundamenta Mathematicae 215.3 (2011): 219-231. <http://eudml.org/doc/283194>.

@article{LiangYu2011,
abstract = {We study the descriptive set theoretical complexity of various randomness notions.},
author = {Liang Yu},
journal = {Fundamenta Mathematicae},
keywords = {randomness; forcing},
language = {eng},
number = {3},
pages = {219-231},
title = {Descriptive set theoretical complexity of randomness notions},
url = {http://eudml.org/doc/283194},
volume = {215},
year = {2011},
}

TY - JOUR
AU - Liang Yu
TI - Descriptive set theoretical complexity of randomness notions
JO - Fundamenta Mathematicae
PY - 2011
VL - 215
IS - 3
SP - 219
EP - 231
AB - We study the descriptive set theoretical complexity of various randomness notions.
LA - eng
KW - randomness; forcing
UR - http://eudml.org/doc/283194
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.