4 citations · 5 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018★ 1 cited
Sequential algorithms and the computational content of classical proofs
Thomas Powell
We develop a correspondence between the theory of sequential algorithms and classical reasoning, via Kreisel's no-counterexample interpretation. Our framework views realizers of th…
cs.LO2018
Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs
Thomas Powell
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,…