Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs
Logic in Computer Science
2018-12-17 v1
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.
Cite
@article{arxiv.1812.05851,
title = {Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs},
author = {Thomas Powell},
journal= {arXiv preprint arXiv:1812.05851},
year = {2018}
}