The problem of giving a computational meaning to classical reasoning lies at the heart of logic. This article surveys three famous solutions to this problem – the epsilon calculus, modified realizability and the Dialectica interpretation – and re-examines them from a modern perspective, with a particular emphasis on connections with algorithms and programming.
CITATION STYLE
Powell, T. (2019). Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs. In Synthese Library (Vol. 412, pp. 255–290). Springer Science and Business Media B.V. https://doi.org/10.1007/978-3-030-20447-1_14
Mendeley helps you to discover research relevant for your work.