| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436629 | Theoretical Computer Science | 2006 | 13 Pages |
Abstract
We define a restriction LHA of Heyting arithmetic HA with the property that all extracted programs are feasible. The restrictions consist in linearity and ramification requirements.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
