Author:
Kawamura Akitoshi,Pauly Arno
Publisher
Springer International Publishing
Reference33 articles.
1. Bauer, A.: Realizability as the connection between computable and constructive mathematics. Tutorial at CCA 2004, notes (2004)
2. Bauer, A.: A relationship between equilogical spaces and type two effectivity. Mathematical Logic Quarterly 48(1), 1–15 (2002)
3. Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. Journal of Computer and System Science 57, 3–19 (1998)
4. Brattka, V., de Brecht, M., Pauly, A.: Closed choice and a uniform low basis theorem. Annals of Pure and Applied Logic 163(8), 968–1008 (2012)
5. Brattka, V., Gherardi, G.: Effective choice and boundedness principles in computable analysis. Bulletin of Symbolic Logic 1, 73–117 (2011), arXiv:0905.4685
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献