Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. Bjerring, J. C., & Skipper, M. (2019). A dynamic solution to the problem of logical omniscience. Journal of Philosophical Logic, 48(3), 501–521.
2. Buss, S. R. (2012). Towards NP-P via proof complexity and search. Annals of Pure and Applied Logic, 163(7), 906–917.
3. Cook, S., & Nguyen, P. (2010). Logical foundations of proof complexity. Cambridge: Cambridge University Press.
4. Dean, W. (2021). Computational complexity theory. In E.N. Zalta (Ed.) The Stanford Encyclopedia of Philosophy (Fall 2021 ed.). Metaphysics Research Lab, Stanford University
5. Field, H. (1984). Is mathematical knowledge just logical knowledge? The Philosophical Review, 93(4), 509–552.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献