Buss, S. (1986). Bounded Arithmetic. PhD Thesis, Princeton. Leivant, D. (1995). Ramified recurrence and computational complexity. Cook, S., Urquhart, A. (1993). Functional programs as inductive definitions. Bellantoni, S., Cook, S. (1992). A new recursion-theoretic characterization of the polytime functions.
Reader Context
Before this section, "Abstract — Bounded Arithmetic" sets context for the current argument. After this page, continue to "Appendix A: Operational Semantics" to follow the next step in the sequence.
This page is part of the free online edition of The Resolution of Math. Core ideas here include bounded, arithmetic, cook, references, buss. Read in sequence for full continuity, then use the related links below to compare framing across books.