( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Bounds on the Strength of Some Restrictions of Hindman's Theorem.

, , , и . CiE, том 10307 из Lecture Notes in Computer Science, стр. 210-220. 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.

Markus Kolodziejczyk

Dieter Kolodziejczyk

Leszek Kalicki

Leszek Skrzypczak

Dieter Kolodziejczyk

 

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

The Polynomial and Linear Hierarchies in V0., и . CiE, том 4497 из Lecture Notes in Computer Science, стр. 408-415. Springer, (2007)How unprovable is Rabin's decidability theorem?, и . LICS, стр. 788-797. ACM, (2016)In Search of the First-Order Part of Ramsey's Theorem for Pairs., и . CiE, том 12813 из Lecture Notes in Computer Science, стр. 297-307. Springer, (2021)The Logical Strength of Büchi's Decidability Theorem., , , и . CSL, том 62 из LIPIcs, стр. 36:1-36:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Real closures of models of weak arithmetic., и . Arch. Math. Log., 52 (1-2): 143-157 (2013)Solutions in XML data exchange., , и . ICDT, стр. 102-113. ACM, (2011)The Strength of the Dominance Rule., и . SAT, том 305 из LIPIcs, стр. 20:1-20:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Ramsey's theorem for pairs, collection, and proof size., , и . J. Math. Log., 24 (2): 2350007:1-2350007:40 (августа 2024)Small Stone in Pool., и . Logical Methods in Computer Science, (2014)Independence results for variants of sharply bounded induction.. Ann. Pure Appl. Log., 162 (12): 981-990 (2011)