Ramsey’s theorem and products in the Weihrauch degrees-Reference-Cited by-同舟云学术

Ramsey’s theorem and products in the Weihrauch degrees

Published:2020-05-13 Issue:2 Volume:9 Page:85-110
ISSN:2211-3576
Container-title:Computability
language:
Short-container-title:COM

Author:

Dzhafarov Damir D.¹,Goh Jun Le²,Hirschfeldt Denis R.³,Patey Ludovic⁴,Pauly Arno⁵

Affiliation:

1. Department of Mathematics, University of Wisconsin-Madison, WI, U.S.A. damir@math.uconn.edu

2. Department of Mathematics, University of Connecticut, CT, U.S.A.. junle.goh@wisc.edu

3. Department of Mathematics, University of Chicago, IL, U.S.A.. drh@math.uchicago.edu

4. Institut Camille Jordan, Université Claude Bernard Lyon 1, France. ludovic.patey@computability.fr

5. Department of Computer Science, Swansea University, U.K.. a.m.pauly@swansea.ac.uk

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference30 articles.

1. The uniform content of partial and linear orders;Astor;Ann. Pure Appl. Logic,2017

2. The Bolzano–Weierstrass theorem is the jump of weak Kőnig’s lemma;Brattka;Ann. Pure Appl. Logic,2012

3. On the Uniform Computational Content of Computability Theory

4. V. Brattka, R. Hölzl and R. Kuyper. Monte Carlo computability, in: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Dagstuhl, Germany, H. Vollmer and B. Vallée, eds, Leibniz International Proceedings in Informatics (LIPIcs), Vol. 66, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017, pp. 17:1–17:14.

5. Measuring the complexity of computational content (Dagstuhl Seminar 15392);Brattka;Dagstuhl Reports,2016

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Weihrauch degree of the additive Ramsey theorem;Computability;2024-04-23

2. On the first-order parts of problems in the Weihrauch degrees;Computability;2024-01-31

3. The Weakness of Finding Descending Sequences in Ill-Founded Linear Orders;Lecture Notes in Computer Science;2024

4. Algebraic properties of the first-order part of a problem;Annals of Pure and Applied Logic;2023-07

5. FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS;The Journal of Symbolic Logic;2021-02-01