On the computational content of the Axiom of Choice (1995)
Edit Page
Report
Scan day: 05 March 2014 UTC
12
Virus safety - good
Description: Article by S. Berardi, M. Bezem and T. Coquand presenting a possible computational content of the negative translation of classical analysis with the Axiom of Choice.
CiteSeerX — On the computational content of the Axiom of Choice On the computational content of the Axiom of Choice (1995) Other Repositories/Bibliography by Stefano Berardi , Marc Bezem , Thierry Coquand
Size: 206 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | CiteSeerX — On the computational content of the Axiom of Choice |
| Keywords: | CiteSeerX, Stefano Berardi, Marc Bezem, Thierry Coquand |
| Description: | CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): 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. |
| IP-address: | 130.203.136.95 |
WHOIS Info
| NS | Name Servers: NS1.PSU.EDU 128.118.25.6 NS2.PSU.EDU 128.118.70.6 |
| WHOIS | |
| Date | activated: 14-Jul-1986 last updated: 22-May-2013 expires: 31-Jul-2014 |