Refined program extraction from classical proofs

https://doi.org/10.1016/S0168-0072(01)00073-2Get rights and content
Under an Elsevier user license
open archive

Abstract

The paper presents a refined method of extracting reasonable and sometimes unexpected programs from classical proofs of formulas of the form ∀x∃yB. We also generalize previously known results, since B no longer needs to be quantifier-free, but only has to belong to a strictly larger class of so-called “goal formulas”. Furthermore we allow unproven lemmas D in the proof of ∀x∃yB, where D is a so-called “definite” formula.

MSC

03F10
03F50

Keywords

Program extraction
A-translation
Definite formula

Cited by (0)