Author of the publication

Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination.

, , and . Notre Dame J. Formal Log., 51 (1): 127-159 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Limit computability and ultrafilters., , , and . Comput., 12 (2): 101-115 (2023)Martin-Löf randomness and Galton-Watson processes., and . Ann. Pure Appl. Log., 163 (5): 519-529 (2012)Natural Large Degree Spectra., , and . Comput., 2 (1): 1-8 (2013)Lowness for Difference Tests., and . Notre Dame J. Formal Log., 55 (1): 63-73 (2014)Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination., , and . Notre Dame J. Formal Log., 51 (1): 127-159 (2010)Low upper bounds in the LR degrees.. Ann. Pure Appl. Log., 163 (3): 314-320 (2012)Members of Random Closed Sets., and . CiE, volume 5635 of Lecture Notes in Computer Science, page 144-153. Springer, (2009)Promptness does not imply superlow cuppability.. J. Symb. Log., 74 (4): 1264-1272 (2009)Strengthening prompt simplicity., and . J. Symb. Log., 76 (3): 946-972 (2011)