Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Brattka, V., Dzhafarov, D., Marcone, A., Pauly, A.: Measuring the complexity of computational content: from combinatorial problems to analysis (Dagstuhl Seminar 18361). Dagstuhl Rep. 8 (2018) (to appear)
2. Brattka, V., Gherardi, G.: Effective choice and boundedness principles in computable analysis. Bull. Symb. Log. 17(1), 73–117 (2011).
https://doi.org/10.2178/bsl/1294186663
3. Brattka, V., Kawamura, A., Marcone, A., Pauly, A.: Measuring the complexity of computational content (Dagstuhl Seminar 15392). Dagstuhl Rep. 5(9), 77–104 (2016).
https://doi.org/10.4230/DagRep.5.9.77
4. Brattka, V., Rakotoniaina, T.: On the uniform computational content of Ramsey’s theorem. J. Symb. Log. 82(4), 1278–1316 (2017).
https://doi.org/10.1017/jsl.2017.43
5. Dorais, F.G.: Classical consequences of continuous choice principles from intuitionistic analysis. Notre Dame J. Form. Log. 55(1), 25–39 (2014).
https://doi.org/10.1215/00294527-2377860
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献