On the computational content of the axiom of choice

Journal of Symbolic Logic 63 (2):600-622 (1998)
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 Godel's Dialectica interpretation
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,273
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Ulrich Berger (2005). Uniform Heyting Arithmetic. Annals of Pure and Applied Logic 133 (1):125-148.
Martín Escardó & Paulo Oliva (2012). The Peirce Translation. Annals of Pure and Applied Logic 163 (6):681-692.
Klaus Aehlig (2008). Parameter-Free Polymorphic Types. Annals of Pure and Applied Logic 156 (1):3-12.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

17 ( #91,421 of 1,096,251 )

Recent downloads (6 months)

7 ( #25,569 of 1,096,251 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.