Counting as integration in feasible analysis
Fernando A.F. Ferreira, Gilda Ferreira · Mathematical logic quarterly · 2006
Abstract Suppose that it is possible to integrate real functions over a weak base theory related to polynomial time computability. Does it follow that we can count? The answer seems to be: obviously yes! We try to convince the reader that the severe restrictions on induction in feasible theories preclude a straightforward answer. Nevertheless, a more sophisticated reflection does indeed show that the answer is affirmative. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)