Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. On the computational content of the axiom of choice;Berardi;J. Symbolic Logic,1998
2. U. Berger, P. Oliva, Modified bar recursion and classical dependent choice, preprint.
3. A semantics of evidence for classical arithmetic;Coquand;J. Symbolic Logic,1995
4. J.-Y. Girard, Une extension de l'interprétation de Gödel à l’analyse, in: Proc. Second Scand. Logic Symp. North-Holland, Amsterdam, 1971, pp. 63–92.
5. T. Griffin, A formulæ-as-type notion of control, in: Conference Record of the 17th ACM Symp. on Principles of Programming Languages, 1990.
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Compositional Theory of Krivine’s Classical Realisability;Lecture Notes in Computer Science;2024
2. A first-order completeness result about characteristic Boolean algebras in classical realizability;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
3. On the Necessity of Some Topological Spaces;Revolutions and Revelations in Computability;2022
4. A Constructive Logic with Classical Proofs and Refutations;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
5. Intuitionistic fixed point logic;Annals of Pure and Applied Logic;2021-03