Predicative arithmetic

Princeton, N.J.: Princeton University Press (1986)
  Copy   BIBTEX

Abstract

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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,148

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
36 (#700,171)

6 months
4 (#1,001,068)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references