## Predicative Arithmetic. (MN-32) |

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
- Mathematical Notes
Phillip A. Griffiths, John N. Mather, and Elias M. Stein, series editors
| |||||||

| |||||||

| |||||||

Questions and comments to: webmaster@press.princeton.edu |

Send me emails about new books in: | |

Mathematics | |

More Choices |