A program for the full axiom of choice
A program for the full axiom of choice
复制标题
完整选择公理的程序
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
J. Krivine
中科院分区：
文献类型：
--
作者：
J. Krivine
经典可实现性理论是柯里-霍华德理论的一个框架
The theory of classical realizability is a framework for the Curry-Howard
correspondence which enables to associate a program with each proof in
Zermelo-Fraenkel set theory. But, almost all the applications of mathematics in
physics, probability, statistics, etc. use Analysis i.e. the axiom of dependent
choice (DC) or even the (full) axiom of choice (AC). It is therefore important
to find explicit programs for these axioms. Various solutions have been found
for DC, for instance the lambda-term called "bar recursion" or the instruction
"quote" of LISP. We present here the first program for AC.