Automated Constructivization of Proofs
Résumé
No computable function can output a constructive proof from a classical one whenever its associated theorem also holds constructively. We show in this paper that it is however possible, in practice, to turn a large amount of classical proofs into constructive ones. We describe for this purpose a linear-time constructivization algorithm which is provably complete on large fragments of predicate logic.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...