Π11‐Martin‐Löf randomness and Π11‐Solovay completeness

DOI10.1002/malq.201700041OpenAlexW2981155857MaRDI QIDQ5108862

Claude Sureson

Publication date: 6 May 2020

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201700041

Mathematics Subject Classification ID

Descriptive set theory (03E15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Algorithmic randomness and dimension (03D32)

Cites Work

• \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets
• Recursion theory. Computational aspects of definability
• Randomness and Recursive Enumerability
• Randomness, Computability, and Density
• Algorithmic Randomness and Complexity
• Set Theory
• Randomness via effective descriptive set theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Π11‐Martin‐Löf randomness and Π11‐Solovay completeness