MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

On the computational content of the Axiom of Choice (1995) [20 citations — 1 self]

by Stefano Berardi ,  Marc Bezem ,  Thierry Coquand
Add To MetaCart

Abstract:

We present a possible computational content of the negative translation of classical analysis with the Axiom of Choice. Our interpretation seems computationally more direct than the one based on Gödel's Dialectica interpretation [10, 18]. Interestingly, this interpretation uses a refinement of the realizibility 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, and how to interpret the axiom of Dependent Choice and Spector's Double Negation Shift.

Citations

272 Conservative Analysis – Bishop, Bridges - 1985
173 Mathematical logic – Shoenfield - 1967
171 Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists – Osherson, Stob, et al. - 1986
99 Metamathematical investigation of intuitionistic arithmetic and analysis Springer LNM 344 – Troelstra - 1973
61 What is Mathematics – Courant, Robbins - 1978
58 Extracting Constructive Content from Classical Proofs – Murthy - 1990
50 On the interpretation of intuitionistic number theory – Kleene - 1945
33 Normal derivability in classical logic – Tait - 1968
32 Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics – Spector - 1962
30 A Semantics of Evidence for Classical Arithmetic – Coquand - 1995
15 Zermelo's Axiom of Choice: Its Origins, Development, and Influence – Moore - 1982
13 Die logischen Grundlagen der Mathematik – Hilbert - 1923
12 Begründung des “tertium non datur” mittels der Hilbertschen Theorie der Widerspruchsfreiheit – Ackermann - 1924
11 Normal form theorem for barrecursive functions of finite type – Tait - 1971
10 Functional interpretation of bar induction by bar recursion – Howard - 1968
8 Finding computational content in classical proofs – Constable, Murthy - 1991
7 Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis – Howard, Kreisel - 1966
6 On the principle of excluded middle – Kolmogorov - 1967
4 Strong normalization of barrecursive terms without using infinite terms – Bezem - 1985
1 Intuitionistic arithmetic as a theory of constructions – Goodman - 1968
1 On the consistency of certain logical calculi – Novikoff - 1943
View or Download | Add to My Collection | Correct Errors