10 search results - page 1 / 2 » A Constructive Proof of the Heine-Borel Covering Theorem for... |
TYPES
1995
Springer
13 years 9 months ago
1995
Springer
LICS
2003
IEEE
13 years 10 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
TYPES
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
TYPES
2000
Springer
13 years 9 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...
ENTCS
2006
13 years 5 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...