Metamathematics of First-Order Arithmetic

This is a monograph on the metamathematics of first order arithmetic. The primary readership is active researchers and graduate students in mathematical logic, in particular those specializing in theories of the natural numbers. The middle part of the book on incompleteness may be of interest to philosophers. The last part, on computational complexity, has applications to computer science.

Coverage of incompleteness of interest to philosophers concerned with its implications * Coverage of computational complexity and its connections to provability will interest computer scientists

Inhalt
Preliminaries.- A.- I: Arithmetic as Number Theory, Set Theory and Logic.- II: Fragments and Combinatorics.- B.- III: Self-Reference.- IV: Models of Fragments of Arithmetic.- C.- V: Bounded Arithmetic.- Bibliographical Remarks and Further Reading.- Index of Terms.- Index of Symbols.