Walter Dean
Contact:Walter Dean (W.H.Dean@warwick.ac.uk) Office hours for term 1 20202021: Monday 11:0013:00 (by appointment on Teams) For terms 2 and 3 of 20202021 and all of 20212022, I will be on research leave as a von Humboldt fellow at the MCMP in Munich. Education: Interests: Mathematics and Philosophy Degree: 
Teaching:202020201

Upcoming and recent talks:

Publications:
2020:
 "On the methodology of informal rigour: Set theory, semantics, and intuitionism" (with Hidenori Kurokawa), forthcoming in Intuitionism, Computation, and Proof: Selected themes from the research of G. Kreisel, M. AnonuttiMarfori and M. Petrolo (editors), Springer. (Comments welcome, please do not cite without permission.)
 "Recursive functions" in the Stanford Encyclopedia of Philosophy
 Bernays, Paul Isaak (18881977). In The Bloomsbury Encyclopedia of Philosophers
 "On consistency and existence in mathematics" forthcoming in the Proceedings of the Aristotelian Society.
2019:
 "Incompleteness via paradox and completeness", Review of Symbolic Logic, 2019, pp. 150.
 "Computational complexity theory and the philosophy of mathematics", Philosophia Mathematica, 27(3), pp. 381439.
2018:
 "Strict finitism, feasibility and the sorites", Review of Symbolic Logic, 2018, 11(2), pp.295346.
2017:
 "The Prehistory of the Subsystems of SecondOrder Arithmetic" (with Sean Walsh), Review of Symbolic Logic, 10(2), pp. 357396.
 "Bernays and the completeness theorem", Annals of the Japan Association for Philosophy of Science, 2017, 25, pp. 4555.
2016:
 "Algorithms and the mathematical foundations of computer science", in The Limits of Mathematical Knowledge, L. Horsten and P. Welch (eds.). Oxford University Press, 2016.
 "Squeezing feasibility", in Pursuit of the Universal: 12th Conference on Computability in Europe, CiE 2016, Lecture Notes in Computer Science, pp 7888.
2015
 "Computational Complexity Theory", Stanford Encyclopedia of Philosophy.
 "Kreisel’s Theory of Constructions, the KreiselGoodman paradox, and the second clause" (with Hidenori Kurokawa), Advances in proof theoretic semantics, T. Piecha and P. SchroederHeister (eds.), Springer Trends in Logic.
2014
 "Arithmetical reflection and the provability of soundness", Philosophia Mathematica.
 "Explicit modal logic, informal provability and Montague's Paradox", Notre Dame Journal of Formal Logic, 55 (2), 2014.
2013
 "Models and computability", Philosophia Mathematica.
 "The paradox of the Knower revisited" (with Hidenori Kurokawa), Annals of Pure and Applied Logic.
2011
2010:
2009:
2008:
 “Algorithms and Ontology” Proceedings of the Austrian Ludwig Wittgenstein Society, Kirchberg am Wechsel, Austria.
 “The Knower Paradox and the Quantified Logic of Proofs” (with Hidenori Kurokawa), Proceedings of the Austrian Ludwig Wittgenstein Society, Kirchberg am Wechsel, Austria.
2007:
 “On Moschovakis’s theory of algorithmic identity”, Proceedings of the 7th Panhellenic Logic Symposium, Volos, Greece.