Realizability in classical logic
Abstract
We explore the Curry-Howard (proof-program) correspondence in Analysis (classical second order arithmetic with dependent choice). The essential tool is a new form of realizability. This paper will appear in "Panoramas et synthèses".
Origin | Files produced by the author(s) |
---|