当前位置:
X-MOL 学术
›
Math. Logic Q.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
Mathematical Logic Quarterly ( IF 0.4 ) Pub Date : 2019-10-17 , DOI: 10.1002/malq.201700041 Claude Sureson 1
Mathematical Logic Quarterly ( IF 0.4 ) Pub Date : 2019-10-17 , DOI: 10.1002/malq.201700041 Claude Sureson 1
Affiliation
Developing an analogue of Solovay reducibility in the higher recursion setting, we show that results from the classical computably enumerable case can be extended to the new context.
中文翻译:
Π11-Martin-Löf随机性和Π11-Solovay完整性
在更高的递归设置中开发Solovy可简化性的类似物,我们证明了经典可计算枚举案例的结果可以扩展到新的背景。
更新日期:2019-10-17
中文翻译:
Π11-Martin-Löf随机性和Π11-Solovay完整性
在更高的递归设置中开发Solovy可简化性的类似物,我们证明了经典可计算枚举案例的结果可以扩展到新的背景。