Cholak, Peter A.; Dzhafarov, Damir D.; Hirschfeldt, Denis R.; Patey, Ludovic Some results concerning the \(\mathsf{SRT}_2^2\) vs. \(\mathsf{COH}\) problem. (English) Zbl 07271573 Computability 9, No. 3-4, 193-217 (2020). MSC: 03D PDF BibTeX XML Cite \textit{P. A. Cholak} et al., Computability 9, No. 3--4, 193--217 (2020; Zbl 07271573) Full Text: DOI
Dzhafarov, Damir D.; Goh, Jun Le; Hirschfeldt, Denis R.; Patey, Ludovic; Pauly, Arno Ramsey’s theorem and products in the Weihrauch degrees. (English) Zbl 07271557 Computability 9, No. 2, 85-110 (2020). MSC: 03D PDF BibTeX XML Cite \textit{D. D. Dzhafarov} et al., Computability 9, No. 2, 85--110 (2020; Zbl 07271557) Full Text: DOI
Carlucci, Lorenzo A weak variant of Hindman’s theorem stronger than Hilbert’s theorem. (English) Zbl 1384.03094 Arch. Math. Logic 57, No. 3-4, 381-389 (2018). MSC: 03B30 05D10 03F35 PDF BibTeX XML Cite \textit{L. Carlucci}, Arch. Math. Logic 57, No. 3--4, 381--389 (2018; Zbl 1384.03094) Full Text: DOI arXiv
Dzhafarov, Damir D.; Patey, Ludovic Coloring trees in reverse mathematics. (English) Zbl 1423.03048 Adv. Math. 318, 497-514 (2017). MSC: 03B30 03D80 03F35 05C55 05D10 PDF BibTeX XML Cite \textit{D. D. Dzhafarov} and \textit{L. Patey}, Adv. Math. 318, 497--514 (2017; Zbl 1423.03048) Full Text: DOI
Dzhafarov, Damir D.; Jockusch, Carl G. jun.; Solomon, Reed; Westrick, Linda Brown Effectiveness of Hindman’s theorem for bounded sums. (English) Zbl 06700057 Day, Adam (ed.) et al., Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-50061-4/pbk; 978-3-319-50062-1/ebook). Lecture Notes in Computer Science 10010, 134-142 (2017). MSC: 03D80 03B30 03F35 05D10 PDF BibTeX XML Cite \textit{D. D. Dzhafarov} et al., Lect. Notes Comput. Sci. 10010, 134--142 (2017; Zbl 06700057) Full Text: DOI
Peretyat’kin, M. G. First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories. (Russian, English) Zbl 1374.03023 Mat. Tr. 18, No. 2, 61-92 (2015); translation in Sib. Adv. Math. 26, No. 3, 196-214 (2016). MSC: 03C07 03C57 PDF BibTeX XML Cite \textit{M. G. Peretyat'kin}, Mat. Tr. 18, No. 2, 61--92 (2015; Zbl 1374.03023); translation in Sib. Adv. Math. 26, No. 3, 196--214 (2016) Full Text: DOI
Salo, Ville; Törmä, Ilkka Constructions with countable subshifts of finite type. (English) Zbl 1359.68210 Fundam. Inform. 126, No. 2-3, 263-300 (2013). MSC: 68Q80 03D78 37B10 68R15 PDF BibTeX XML Cite \textit{V. Salo} and \textit{I. Törmä}, Fundam. Inform. 126, No. 2--3, 263--300 (2013; Zbl 1359.68210) Full Text: arXiv
Lohrey, Markus; Mathissen, Christian Isomorphism of regular trees and words. (English) Zbl 1295.68124 Inf. Comput. 224, 71-105 (2013). Reviewer: Magnus Steinby (Turku) MSC: 68Q17 03C57 03D05 68Q25 68Q45 68R15 PDF BibTeX XML Cite \textit{M. Lohrey} and \textit{C. Mathissen}, Inf. Comput. 224, 71--105 (2013; Zbl 1295.68124) Full Text: DOI
Marcone, Alberto; Montalbán, Antonio; Shore, Richard A. Computing maximal chains. (English) Zbl 1252.03105 Arch. Math. Logic 51, No. 5-6, 651-660 (2012). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D80 03D45 06A07 PDF BibTeX XML Cite \textit{A. Marcone} et al., Arch. Math. Logic 51, No. 5--6, 651--660 (2012; Zbl 1252.03105) Full Text: DOI arXiv
Lohrey, Markus; Mathissen, Christian Isomorphism of regular trees and words. (English) Zbl 1333.68126 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 210-221 (2011). MSC: 68Q17 03C57 03D05 68Q25 68Q45 68R15 PDF BibTeX XML Cite \textit{M. Lohrey} and \textit{C. Mathissen}, Lect. Notes Comput. Sci. 6756, 210--221 (2011; Zbl 1333.68126) Full Text: DOI
Simonsen, Jakob Grue Beta-shifts, their languages, and computability. (English) Zbl 1217.03029 Theory Comput. Syst. 48, No. 2, 297-318 (2011). MSC: 03D78 68Q17 68Q45 68R15 PDF BibTeX XML Cite \textit{J. G. Simonsen}, Theory Comput. Syst. 48, No. 2, 297--318 (2011; Zbl 1217.03029) Full Text: DOI
Schmerl, James H. Reverse mathematics and graph coloring: eliminating diagonalization. (English) Zbl 1083.03053 Simpson, Stephen G. (ed.), Reverse mathematics 2001. Wellesley, MA: A K Peters; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 1-56881-263-9/hbk; 1-56881-264-7/pbk). Lecture Notes in Logic 21, 331-348 (2005). Reviewer: Jeffry L. Hirst (Boone) MSC: 03F35 03B30 05C15 PDF BibTeX XML Cite \textit{J. H. Schmerl}, Lect. Notes Log. 21, 331--348 (2005; Zbl 1083.03053)
Régnier, Mireille; Denise, Alain Rare events and conditional events on random strings. (English) Zbl 1059.05008 Discrete Math. Theor. Comput. Sci. 6, No. 2, 191-213 (2004). MSC: 05A15 05A16 60E05 60F10 PDF BibTeX XML Cite \textit{M. Régnier} and \textit{A. Denise}, Discrete Math. Theor. Comput. Sci. 6, No. 2, 191--213 (2004; Zbl 1059.05008) Full Text: EMIS EuDML
Downey, Rod; Remmel, J. B. Questions in computable algebra and combinatorics. (English) Zbl 0980.03045 Cholak, Peter A. (ed.) et al., Computability theory and its applications. Current trends and open problems. Proceedings of a 1999 AMS-IMS-SIAM joint summer research conference, Boulder, CO, USA, June 13-17, 1999. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 257, 95-125 (2000). Reviewer: Marat M.Arslanov (Kazan) MSC: 03D45 03D25 03-02 20F10 PDF BibTeX XML Cite \textit{R. Downey} and \textit{J. B. Remmel}, Contemp. Math. 257, 95--125 (2000; Zbl 0980.03045)
Kushilevitz, Eyal Privacy and communication complexity. (English) Zbl 0753.94006 SIAM J. Discrete Math. 5, No. 2, 273-284 (1992). Reviewer: P.Cotae (Iaşi) MSC: 94A15 94A60 68R05 PDF BibTeX XML Cite \textit{E. Kushilevitz}, SIAM J. Discrete Math. 5, No. 2, 273--284 (1992; Zbl 0753.94006) Full Text: DOI
Carstens, Hans-Georg; Paeppinghaus, Peter Recursive coloration of countable graphs. (English) Zbl 0527.03025 Ann. Pure Appl. Logic 25, 19-45 (1983). MSC: 03D45 03C57 05C15 PDF BibTeX XML Cite \textit{H.-G. Carstens} and \textit{P. Paeppinghaus}, Ann. Pure Appl. Logic 25, 19--45 (1983; Zbl 0527.03025) Full Text: DOI