Highly Influenced

# Cycling in proofs and feasibility

@inproceedings{Carbone2000CyclingIP, title={Cycling in proofs and feasibility}, author={Alessandra Carbone}, year={2000} }

- Published 2000
DOI:10.1090/S0002-9947-99-02300-4

There is a common perception by which small numbers are considered more concrete and large numbers more abstract. A mathematical formalization of this idea was introduced by Parikh (1971) through an inconsistent theory of feasible numbers in which addition and multiplication are as usual but for which some very large number is defined to be not feasible. Parikh shows that sufficiently short proofs in this theory can only prove true statements of arithmetic. We pursue these topics in light of… CONTINUE READING