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....
Autor principal: | |
---|---|
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Princeton :
Princeton University Press,
2014.
|
Colección: | Book collections on Project MUSE.
|
Temas: | |
Acceso en línea: | Texto completo |
Sumario: | 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. |
---|---|
Descripción Física: | 1 online resource. |
ISBN: | 9781400858927 |