On the Reals Which Cannot Be Random

DOI10.1007/978-3-319-50062-1_36zbMath1485.03167OpenAlexW2559696983MaRDI QIDQ2970982

Liang Yu, Yizheng Zhu

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_36

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Algorithmic randomness and dimension (03D32) Determinacy principles (03E60)

Related Items

RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inner models with many Woodin cardinals
• Projectively well-ordered inner models
• Recursion theory. Computational aspects of definability
• A model of set-theory in which every set of reals is Lebesgue measurable
• DEMUTH’S PATH TO RANDOMNESS
• KWithout the Measurable
• An Outline of Inner Model Theory
• Algorithmic Randomness and Complexity
• Minimal Covers and Hyperdegrees
• The Theory of Countable Analytical Sets
• The maximality of the core model
• Set Theory
• Measures and their random reals