Notes on Sacks' splitting theorem

DOI10.1017/JSL.2023.77MaRDI QIDQ7033945zbMATH OpenFDO

Authors Klaus Ambos-Spies, Rodney G. Downey, Martin Monath, Keng Meng Ng

Publication date 3 February 2025

Published in The Journal of Symbolic Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/JSL.2023.77

zbMATH Keywords

Downey-Greenberg hierarchySacks splitting theoremtotally \(\omega \)-c.a. setunbounded finite injury

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Cites work

• A hierarchy of computably enumerable degrees
• A Hierarchy of Turing Degrees
• Algorithmic randomness and complexity.
• Finite injury and Σ₁-induction
• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• Nonstandard models in recursion theory and reverse mathematics
• On the degrees less than 0'
• Splitting an α-Recursively Enumerable Set
• Splitting into degrees with low computational strength
• Splitting theorems in recursion theory
• The infinite injury priority method
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• ∑ n Definable Sets without ∑ n Induction

This page was built for publication: Notes on Sacks' splitting theorem

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