\(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination
From MaRDI portal
Publication:976541
DOI10.1215/00294527-2010-009zbMath1197.03045MaRDI QIDQ976541
Damir D. Dzhafarov, David E. 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
survey paper; Peano arithmetic; randomness; \(\Pi^0_1\) classes; basis theorems; computable domination; hyperimmunity
03F30: First-order arithmetic and fragments
03C62: Models of arithmetic and set theory
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
03D32: Algorithmic randomness and dimension
Related Items
Computability of Subsets of Metric Spaces, An effectively closed set with no join property*, On the cardinality of future worldlines in discrete spacetime structures, COMPUTABLY COMPACT METRIC SPACES, Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy, Randomness below complete theories of arithmetic, choice classes