### Abstract

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.

Original language | English |
---|---|

Title of host publication | Mathesis Universalis, Computability and Proof |

Editors | Stefania Centrone, Sara Negri, Deniz Sarikaya, Peter M. Schuster |

Publisher | Springer International Publishing |

Pages | 255-290 |

ISBN (Electronic) | 978-3-030-20447-1 |

ISBN (Print) | 978-3-030-20446-4 |

DOIs | |

Publication status | Published - 2019 |

### Publication series

Name | Synthese Library |
---|---|

Volume | 412 |

## Cite this

Powell, T. (2019). Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs. In S. Centrone, S. Negri, D. Sarikaya, & P. M. Schuster (Eds.),

*Mathesis Universalis, Computability and Proof*(pp. 255-290). [Chapter 14] (Synthese Library; Vol. 412). Springer International Publishing. https://doi.org/10.1007/978-3-030-20447-1_14