This book develops arithmetic without the induction principle, working in theories that are interpretable in Raphael Robinson's theory Q. Certain inductive formulas, the bounded ones, are interpretable in Q. A mathematically strong, but logically very weak, predicative arithmetic is constructed. Originally published in 1986. The **Princeton Legacy Library** uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. Acknowledgments Table of Contents Chapter 1. The impredicativity of induction Chapter 2. Logical terminology Chapter 3. The axioms of arithmetic Chapter 4. Order Chapter 5. Induction by relativization Chapter 6. Interpretability in Robinson's theory Chapter 7. Bounded induction Chapter 8. The bounded least number principle Chapter 9. The euclidean algorithm Chapter 10. Encoding Chapter 11. Bounded separation and minimum Chapter 12. Sets and functions Chapter 13. Exponential functions Chapter 14. Exponentiation Chapter 15. A stronger relativization scheme Chapter 16. Bounds on exponential functions Chapter 17. Bounded replacement Chapter 18. An impassable barrier Chapter 19. Sequences Chapter 20. Cardinality Chapter 21. Existence of sets Chapter 22. Semibounded Replacement Chapter 23. Formulas Chapter 24. Proofs Chapter 25. Derived rules of inference Chapter 26. Special constants Chapter 27. Extensions by definition Chapter 28. Interpretations Chapter 29. The arithmetization of arithmetic Chapter 30. The consistency theorem Chapter 31. Is exponentiation total? Chapter 32. A modified Hilbert program Bibliography General index Index of defining axioms This book develops arithmetic without the induction principle, working in theories that are interpretable in Raphael Robinson's theory Q. Certain inductive formulas, the bounded ones, are interpretable in Q.A mathematically strong, but logically very weak, predicative arithmetic is constructed. Originally published in 1986. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original texts of these important books while presenting them in durable paperback editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905
