Authors
Klaus Ambos-Spies, Rod G Downey, Martin Monath, Keng Meng Ng
Publication date
2023/10/26
Journal
The Journal of Symbolic Logic
Pages
1-30
Publisher
Cambridge University Press
Description
We explore the complexity of Sacks’ Splitting Theorem in terms of the mind change functions associated with the members of the splits. We prove that, for any c.e. set A, there are low computably enumerable sets .
Total citations
20191
Scholar articles
K Ambos-Spies, RG Downey, M Monath, KM Ng - The Journal of Symbolic Logic, 2023