An arithmetic for polynomial-time computation

Helmut Schwichtenberg
2006 Theoretical Computer Science  
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.
doi:10.1016/j.tcs.2006.03.019 fatcat:waup2znmyfca5j2dypaqbvwdn4