Cambridge University Press , Cambridge Introductions to Philosophy Malicorne sur Sarthe, 72, Pays de la Loire, France 2008 Book condition, Etat : Très bon paperback, editor's red and yellow wrappers, illustrated by a multicolor illustration grand In-8 1 vol. - 375 pages
many black and white text-figures 2nd reprinted edition, 2008 Contents, Chapitres : Contents, Preface, xiv, Text, Further reading, Bibliography, Index, 361 pages - What Gödel's theorems say Decidability and enumerability Axiomatized formal theories Capturing numerical properties - The truths of arithmetic - Sufficiently strong arithmetics Interlude : Taking stock - Two formalized arithmetics What Q can prove - First-order Peano arithmetic - Primitive recursive functions Capturing p.r. functions - Q is p.r. adequate Interlude : A very little about principia - The arithmetization of syntax PA is incomplete - Gödel's first theorem Interlude : about the first theorem Strengthening the first theorem The diagonalization Lemma Using the diagonalization lemma Second-order arithmetics - Interlude : Incompleteness and Isaacsons conjecture - Gödel's second theorem for PA The derivability conditions Deriving the derivability conditions Reflections - Interlude : About the second theorem µ-recursive functions Undecidability and incompleteness Turing machines Turing machines and recursiveness Halting problem The church-turing thesis Proving the thesis ? - Looking back near fine copy, no markings