Predicative Arithmetic (eBook)

Edward Nelson (Autor)

eBook Download: PDF

2014
200 Seiten
Princeton University Press (Verlag)
978-1-4008-5892-7 (ISBN)

Infos

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 editions preserve the original texts of these important books while presenting them in durable paperback and hardcover 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.

Produkt-Details

• Erscheint lt. Verlag: 14.7.2014
• Reihe/Serie: Mathematical Notes
• Reihe/Serie: Mathematical Notes
• Reihe/Serie: Princeton Legacy Library
• Reihe/Serie: Princeton Legacy Library
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Sachbuch/Ratgeber ► Natur / Technik ► Naturwissenschaft
• Themenwelt: Mathematik / Informatik ► Mathematik
• Themenwelt: Technik
• Schlagworte: Addition • Adjunction (field theory) • age of the universe • Almost surely • arithmetic • Arithmetic IF • Atomic formula • Axiom • axiomatic system • Beta function • Big O notation • Binary number • Binary Relation • Brownian motion • canonical form • Cardinality • Cartesian coordinate system • chessboard • classical mathematics • Closed-form expression • commutative property • Computation • conservative extension • consistency • Contradiction • Deduction theorem • DIAMETER • Direct proof • Domain of discourse • Elementary mathematics • Elias M. Stein • existential quantification • exponential function • exponentiation • Extension by definitions • Finitary • Finite set • Formula C (SCCA) • Foundations of mathematics • Fundamenta Mathematicae • Gödel's completeness theorem • Herbrand's theorem • impredicativity • Inaccessible cardinal • inference • Interpretability • John Milnor • Logic • Logical connective • Mathematical Induction • Mathematical Logic • mathematician • Mathematics • Measurable cardinal • metamathematics • Metatheorem • model Theory • Mostowski • Natural number • Negation • non-standard analysis • Notation • p-adic analysis • Peano axioms • polynomial • Positional notation • Power of two • Power set • Primitive notion • Primitive Recursive Function • Principia Mathematica • Probability Theory • Quantifier (logic) • Quantity • Ranking (information retrieval) • Rational number • real number • Recursion (computer science) • remainder • Requirement • Robert Langlands • Rule of inference • scientific notation • Sequence • set theory • Subset • Theorem • theory • Transfer principle • Transfinite number • Triviality (mathematics) • Tuple • uniqueness • Universal quantification • Variable (mathematics) • Zermelo–Fraenkel set theory
• ISBN-10: 1-4008-5892-5 / 1400858925
• ISBN-13: 978-1-4008-5892-7 / 9781400858927