Communication Dans Un Congrès Année : 2017

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.

Fichier principal
Vignette du fichier
constructivization.pdf (261.81 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01516788 , version 1 (02-05-2017)

Licence

Identifiants

Citer

Frédéric Gilbert. Automated Constructivization of Proofs. FoSSaCS 2017, Apr 2017, Uppsala, Sweden. ⟨10.1007/978-3-662-54458-7_28⟩. ⟨hal-01516788⟩
350 Consultations
455 Téléchargements

Altmetric

Partager

  • More