Premium
Π 1 1 ‐Martin‐Löf randomness and Π 1 1 ‐Solovay completeness
Author(s) -
Sureson Claude
Publication year - 2019
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.201700041
Subject(s) - completeness (order theory) , randomness , recursion (computer science) , context (archaeology) , mathematics , discrete mathematics , computer science , algorithm , statistics , geography , mathematical analysis , archaeology
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.