دانلود کتاب Predicative Arithmetic. (MN-32)

فهرست مطالب :

Acknowledgments\nTable of Contents\nChapter 1. The impredicativity of induction\nChapter 2. Logical terminology\nChapter 3. The axioms of arithmetic\nChapter 4. Order\nChapter 5. Induction by relativization\nChapter 6. Interpretability in Robinson\'s theory\nChapter 7. Bounded induction\nChapter 8. The bounded least number principle\nChapter 9. The euclidean algorithm\nChapter 10. Encoding\nChapter 11. Bounded separation and minimum\nChapter 12. Sets and functions\nChapter 13. Exponential functions\nChapter 14. Exponentiation\nChapter 15. A stronger relativization scheme\nChapter 16. Bounds on exponential functions\nChapter 17. Bounded replacement\nChapter 18. An impassable barrier\nChapter 19. Sequences\nChapter 20. Cardinality\nChapter 21. Existence of sets\nChapter 22. Semibounded Replacement\nChapter 23. Formulas\nChapter 24. Proofs\nChapter 25. Derived rules of inference\nChapter 26. Special constants\nChapter 27. Extensions by definition\nChapter 28. Interpretations\nChapter 29. The arithmetization of arithmetic\nChapter 30. The consistency theorem\nChapter 31. Is exponentiation total?\nChapter 32. A modified Hilbert program\nBibliography\nGeneral index\nIndex of defining axioms