From post

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.

 

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

Some results concerning the SRT22 vs. COH problem., , , и . Comput., 9 (3-4): 193-217 (2020)Infinite Saturated Orders.. Order, 28 (2): 163-172 (2011)Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018., , , и . Comput., 9 (3-4): 167-168 (2020)On Mathias Generic Sets., , и . CiE, том 7318 из Lecture Notes in Computer Science, стр. 129-138. Springer, (2012)Effectiveness of Hindman's Theorem for Bounded Sums., , , и . Computability and Complexity, том 10010 из Lecture Notes in Computer Science, стр. 134-142. Springer, (2017)Notions of robust information coding., и . Comput., 6 (2): 105-124 (2017)Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination., , и . Notre Dame J. Formal Log., 51 (1): 127-159 (2010)The Complexity of Primes in Computable Unique Factorization Domains., и . Notre Dame J. Formal Log., 59 (2): 139-156 (2018)Reverse mathematics and properties of finite character., и . Ann. Pure Appl. Log., 163 (9): 1243-1251 (2012)Generics for computable Mathias forcing., , , и . Ann. Pure Appl. Log., 165 (9): 1418-1428 (2014)