
The Library
Browse by Warwick Author
![]() | Up a level |
Number of items: 18.
Dean, Walter (2020) Incompleteness via paradox and completeness. Review of Symbolic Logic, 13 (3). pp. 541-592. doi:10.1017/S1755020319000212 ISSN 1755-0203.
Dean, Walter (2020) Bernays, Paul Isaac (1888-1977). In: Bloomsbury Encyclopedia of Philosophers. London: Bloomsbury Academic, an imprint of Bloomsbury Publishing Plc. ISBN 9781350962217
Dean, Walter (2020) Recursive functions. Stanford Encyclopedia of Philosophy . ISSN 1095-5054.
Dean, Walter (2019) Computational complexity theory and the philosophy of mathematics. Philosophia Mathematica, 27 (3). pp. 381-439. doi:10.1093/philmat/nkz021 ISSN 0031-8019.
Dean, Walter (2018) Strict Finitism, Feasibility, and the Sorties. The Review of Symbolic Logic, 11 (2). pp. 295-346. doi:10.1017/S1755020318000163 ISSN 1755-0203.
Dean, Walter (2018) Strict finitism, feasibility, and the sorites. Review of Symbolic Logic, 11 (2). pp. 295-346. doi:10.1017/S1755020318000163 ISSN 1755-0211.
Dean, Walter and Walsh, Sean (2017) The prehistory of the subsystems of second-order arithmetic. The Review of Symbolic Logic, 10 (2). pp. 357-396. ISSN 1755-0203.
Dean, Walter (2017) Bernays and the completeness theorem. Annals of the Japan Association for Philosophy of Science, 25 . pp. 45-55. ISSN 0453-0691.
Dean, Walter (2016) Algorithms and the mathematical foundations of computer science. In: Horsten, L. and Welch, P., (eds.) GoΜdel's disjunction : the scope and limits of mathematical knowledge. Oxford University Press, pp. 19-66. ISBN 9780198759591
Dean, Walter (2016) Squeezing feasibility. In: 12th Conference on Computability in Europe, CiE 2016 : Pursuit of the Universal, Paris, France, 27 Jun - 1 Jul 2016. Published in: Pursuit of the Universal. CiE 2016. , 9709 pp. 78-88. doi:10.1007/978-3-319-40189-8_8 ISSN 0302-9743.
Dean, Walter (2015) Arithmetical reflection and the provability of soundness. Philosophia Mathematica, 23 (1). pp. 31-64. doi:10.1093/philmat/nku026 ISSN 0031-8019.
Dean, Walter (2015) Computational complexity theory. In: Zalta, Edward N., (ed.) The Stanford Encyclopedia of Philosophy. Center for the Study of Language and Information.
Dean, Walter and Kurokawa, Hidenori (2015) Kreisel's theory of constructions, the Kreisel-Goodman paradox, and the second clause. In: Piecha, Thomas and Schroeder-Heister, Peter, (eds.) Advances in Proof-Theoretic Semantics. Trends in Logic, 43 . Springer International Publishing, pp. 27-63. ISBN 9783319226859
Dean, Walter and Kurokawa, Hidenori (2014) The paradox of the knower revisited. Annals of Pure and Applied Logic, Volume 165 (Number 1). pp. 199-224. doi:10.1016/j.apal.2013.07.010 ISSN 0168-0072.
Dean, Walter (2014) Models and computability. Philosophia Mathematica, 22 (2). pp. 143-166. doi:10.1093/philmat/nkt035 ISSN 0031-8019.
Dean, Walter (2014) Montagueβs paradox, informal provability, and explicit modal logic. Notre Dame Journal of Formal Logic, Volume 55 (Number 2). pp. 157-196. doi:10.1215/00294527-2420636 ISSN 0029-4527.
Dean, Walter and Parikh, Rohit (2011) The logic of campaigning. In: Banerjee, Mohua and Seth, Anil, (eds.) Logic and Its Applications : 4th Indian Conference, ICLA 2011, Delhi, India, January 5-11, 2011. Proceedings. Lecture Notes in Computer Science, 6521 . Springer Berlin Heidelberg, pp. 38-49. ISBN 9783642180255
Dean, W. and Kurokawa, H. (2010) From the knowability paradox to the existence of proofs. Synthese, Vol.176 (No.2). pp. 177-225. doi:10.1007/s11229-009-9490-3 ISSN 0039-7857.
This list was generated on Fri Mar 24 15:37:19 2023 GMT.