Author:
Berardi Stefano,Bezem Marc,Coquand Thierry
Abstract
AbstractWe present a possible computational content of the negative translation of classical analysis with the Axiom of (countable) Choice. Interestingly, this interpretation uses a refinement of the realizability semantics of the absurdity proposition, which is not interpreted as the empty type here. We also show how to compute witnesses from proofs in classical analysis of ∃-statements and how to extract algorithms from proofs of ∀∃-statements. Our interpretation seems computationally more direct than the one based on Gödel's Dialectica interpretation.
Publisher
Cambridge University Press (CUP)
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Zeta Functions and the (Linear) Logic of Markov Processes;Logical Methods in Computer Science;2024-08-29
2. Stateful Realizers for Nonstandard Analysis;Logical Methods in Computer Science;2023-04-25
3. Classical consequences of constructive systems;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2023-04-10
4. A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory;Annals of Pure and Applied Logic;2023-04
5. A direct computational interpretation of second-order arithmetic via update recursion;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02