Journal of Symbolic Logic · 1998 · 102 citations · 11 references
ComputingComputer ScienceMathematicsAlgorithmsLogicSet TheoryAxiom Of ChoiceDeductive ReasoningModel TheoryProof ComplexityTheorem ProvingAxiom Of Choice In AnalysisCountable ChoiceRealizability SemanticsRealizability Theory
Abstract We 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.
11
Stéphane Crépey, Olivier Guéant, David Hobson et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2011 · 10.2K citations
Foundations of Constructive Analysis.
Abraham Robinson, Errett Bishop · American Mathematical Monthly · 1968 · 1.3K citations
On the interpretation of intuitionistic number theory
S. C. Kleene · Journal of Symbolic Logic · 1945 · 540 citations
On weak completeness of intuitionistic predicate logic
G. Kreisel · Journal of Symbolic Logic · 1962 · 150 citations
Lectures on modern mathematics
Journal of the Franklin Institute · 1964 · 150 citations