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

Minimal Pairs and Complete Problems., , and . STACS, volume 415 of Lecture Notes in Computer Science, page 24-36. Springer, (1990)Computability and Incomputability.. CiE, volume 4497 of Lecture Notes in Computer Science, page 705-715. Springer, (2007)Computability results used in differential geometry., and . J. Symb. Log., 71 (4): 1394-1410 (2006)Meeting of the Association for Symbolic Logic., , , and . J. Symb. Log., 41 (2): 551-560 (1976)Constructive Order Types on Cuts.. J. Symb. Log., 34 (2): 285-289 (1969)A Note on Degrees of Subsets.. J. Symb. Log., 34 (2): 256 (1969)Computability of Homogeneous Models., and . Notre Dame J. Formal Log., 48 (1): 143-170 (2007)Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets., and . J. Symb. Log., 63 (1): 59-72 (1998)A Problem in the Theory of Constructive Order Types., and . J. Symb. Log., 35 (1): 119-121 (1970)Sets with no Subset of Higher Degrees.. J. Symb. Log., 34 (1): 53-56 (1969)