On the computational content of intuitio
β
Samuel R Buss; Pavel PudlΓ‘k
π
Article
π
2001
π
Elsevier Science
π
English
β 115 KB
The paper proves reΓΏned feasibility properties for the disjunction property of intuitionistic propositional logic. We prove that it is possible to eliminate all cuts from an intuitionistic proof, propositional or ΓΏrst-order, without increasing the Horn closure of the proof. We obtain a polynomial ti