_1⁰ classes, Peano arithmetic, randomness, and computable domination

DOI10.1215/00294527-2010-009zbMATH Open1197.03045OpenAlexW1970107198MaRDI QIDQ976541FDOQ976541

Damir D. Dzhafarov, David Diamondstone, Robert I. Soare

Publication date: 11 June 2010

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2010-009

zbMATH Keywords

survey paperPeano arithmeticrandomness\(\Pi^0_1\) classesbasis theoremscomputable dominationhyperimmunity

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Recursively (computably) enumerable sets and degrees (03D25) First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (9)

• Pathwise-randomness and models of second-order arithmetic
• Computability of Subsets of Metric Spaces
• COMPUTABLY COMPACT METRIC SPACES
• An effectively closed set with no join property*
• On the cardinality of future worldlines in discrete spacetime structures
• Π₀¹-classes and Rado's selection principle
• choice classes
• Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy
• Randomness below complete theories of arithmetic

This page was built for publication: \(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination

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