From post

Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions.

. Computability and Complexity, том 10010 из Lecture Notes in Computer Science, стр. 660-668. Springer, (2017)

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.

 

Другие публикации лиц с тем же именем

Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions.. Computability and Complexity, том 10010 из Lecture Notes in Computer Science, стр. 660-668. Springer, (2017)The Baire Category Theorem in Weak Subsystems of Second-Order Arithmetic., и . J. Symb. Log., 58 (2): 557-578 (1993)Degrees of Unsolvability: A Tutorial.. CiE, том 9136 из Lecture Notes in Computer Science, стр. 83-94. Springer, (2015)Periodic Points and Subsystems of Second-Order Arithmetic., , и . Ann. Pure Appl. Log., 62 (1): 51-64 (1993)A Nonstandard Counterpart of WWKL., и . Notre Dame J. Formal Log., 52 (3): 229-243 (2011)Measure theory and weak König's lemma., и . Arch. Math. Log., 30 (3): 171-180 (1990)Countable algebra and set existence axioms., , и . Ann. Pure Appl. Log., 25 (2): 141-181 (1983)Factorization of polynomials and Σ10 induction., и . Ann. Pure Appl. Log., (1986)A dual form of Erdös-Rado's canonization theorem., , и . J. Comb. Theory A, 42 (2): 159-178 (1986)Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume.. Arch. Math. Log., 25 (1): 45-65 (1985)