Item description for Logic of Arithmetic (Lectures on Mathematical Logic) by Walter Felscher...
For propositional logic it can be decided whether a formula has a deduction from a finite set of other formulas. This volume begins with a method to decide this for the quantified formulas of those fragments of arithmetic which express the properties of order-plus-successor and of order-plus-addition (Presburger arithmetic); it makes use of an algorithm eliminating quantifiers which, in turn, is also applied to obtain consistency proofs for these fragments. Stronger fragments of arithmetic, also containing multiplication, are sufficiently rich to express a primitive recursive encoding of terms, formulas and deductions, and this leads to Godel's theorem exhibiting statements already undecidable in these fragments. Its central idea, isolated in Tarski's fixpoint lemma, has a certain analogy with Eubulides' antinomy of the Liar, and in a non-technical chapter, accessible to a wider class of readers, this analogy is exploited for an informal discussion of undefinability and incompleteness. The technical
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Studio: CRC Press
Est. Packaging Dimensions: Length: 9.5" Width: 6.2" Height: 0.99" Weight: 1.49 lbs.
Release Date May 30, 2000
ISBN 9056992686 ISBN13 9789056992682