On the existence of a connected component of a graph
From MaRDI portal
Publication:3195646
DOI10.3233/COM-150039zbMath1337.03086arXiv1406.4786MaRDI QIDQ3195646
Carl Mummert, Jeffry L. Hirst, Kirill Gura
Publication date: 20 October 2015
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.4786
partition; graph; parallelization; reverse mathematics; component; connected; Weihrauch reducibility
03B30: Foundations of classical theories (including reverse mathematics)
03F35: Second- and higher-order arithmetic and fragments
Related Items
Cites Work
- On the strength of the finite intersection principle
- Closed choice and a uniform low basis theorem
- Connected components of graphs and reverse mathematics
- On the (semi)lattices induced by continuous reducibilities
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- Computability of the Radon-Nikodym Derivative
- Effective Borel measurability and reducibility of functions