Metamathematics of First-Order Arithmetic

Petr Hájek

ISBN 10: 1107168414 / ISBN 13: 9781107168411

Edité par Cambridge University Press, 2017

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - From the reviews: .'This work is a very important contribution to the logical literature. It gives a survey of an incredible number of results and methods in the foundations of arithmetic, presented in a clear and systematic way. It will certainly be highly appreciated by specialists working in the field.' 'Mathematical Reviews, ' USA 1994 .'It is really a highly interesting book - a survey of a large amount of results presented in a systematic and clear way. It will serve as a source of information for those who want to learn meta-mathematics of first-order arithmetic as well as a reference book for people working in this field.' 'Zentralblatt fur Mathematik und Ihre Grenzgebiete,' 781.1994.'.

N° de réf. du vendeur 9781107168411

Détails bibliographiques

• Titre: Metamathematics of First-Order Arithmetic
• Éditeur: Cambridge University Press
• Date de parution: 2017
• Langue: anglais
• ISBN à 10 chiffres: 1107168414
• ISBN à 13 chiffres: 9781107168411
• Reliure: Buch
• État de l'article: Neu

A propos de ce titre

Synopsis

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the third publication in the Perspectives in Logic series, is a much-needed monograph on the metamathematics of first-order arithmetic. The authors pay particular attention to subsystems (fragments) of Peano arithmetic and give the reader a deeper understanding of the role of the axiom schema of induction and of the phenomenon of incompleteness. The reader is only assumed to know the basics of mathematical logic, which are reviewed in the preliminaries. Part I develops parts of mathematics and logic in various fragments. Part II is devoted to incompleteness. Finally, Part III studies systems that have the induction schema restricted to bounded formulas (bounded arithmetic).

À propos des auteurs

Petr Hájek works in the Institute of Computer Science at the Academy of Sciences of the Czech Republic, Prague.

Pavel Pudlák works in the Mathematical Institute at the Academy of Sciences of the Czech Republic, Prague.