journal article
Aug 03, 2020
Compositions of multivalued functions
Topics
No keywords indexed for this article. Browse by subject →
References
12
[1]
Brattka "Closed choice and a uniform low basis theorem" Ann. Pure Appl. Logic (2012) 10.1016/j.apal.2011.12.020
[2]
Brattka "Weihrauch degrees, omniscience principles and weak computability" J. Symbolic Logic (2011) 10.2178/jsl/1294170993
[3]
Brattka "The Bolzano–Weierstrass theorem is the jump of weak König’s lemma" Ann. Pure Appl. Logic (2012) 10.1016/j.apal.2011.10.006
[5]
Brattka "On the uniform computational content of Ramsey’s theorem" J. Symb. Log. (2017) 10.1017/jsl.2017.43
[6]
Cholak "On the strength of Ramsey’s theorem for pairs" J. Symbolic Logic (2001) 10.2307/2694910
[7]
Dorais "On uniform relationships between combinatorial problems" Trans. Amer. Math. Soc. (2016) 10.1090/tran/6465
[9]
On notions of computability-theoretic reduction between Π21 principles
Denis R. Hirschfeldt, Carl G. Jockusch
Journal of Mathematical Logic
10.1142/s0219061316500021
[10]
Hirst "Using Ramsey’s theorem once" Arch. Math. Logic (2019) 10.1007/s00153-019-00664-z
[11]
Patey "The weakness of being cohesive, thin or free in reverse mathematics" Israel J. Math. (2016) 10.1007/s11856-016-1433-3
[12]
Pauly "On the (semi)lattices induced by continuous reducibilities" MLQ Math. Log. Q. (2010) 10.1002/malq.200910104
Metrics
2
Citations
12
References
Details
- Published
- Aug 03, 2020
- Vol/Issue
- 9(3-4)
- Pages
- 231-247
Cite This Article
Jun Le Goh (2020). Compositions of multivalued functions. Computability, 9(3-4), 231-247. https://doi.org/10.3233/com-180235
Related