MARC Record from harvard_bibliographic_metadata

LEADER: 05571nam a22003738a 4500
001 012174595-3
005 20100226095630.0
008 090518s2009 mau b 001 0 eng
010 $a 2009020156
020 $a9781405197663 (hardcover : alk. paper)
020 $a9781405197670 (pbk. : alk. paper)
035 0 $aocn361965956
040 $aDLC$cDLC
041 1 $aeng$hita
050 00 $aQA9.54$b.B4713 2009
082 00 $a511.3$222
100 1 $aBerto, Francesco.
240 10 $aTutti pazzi per Gödel!$lEnglish
245 10 $aThere's something about Gödel! :$bthe complete guide to the incompleteness theorem /$cFrancesco Berto.
260 $aMalden, MA :$bWiley-Blackwell,$cc2009.
300 $axx, 233 p. ;$c23 cm.
504 $aIncludes bibliographical references (p. [217]-224) and index.
505 0 $aThe Gödelian symphony -- Foundations and paradoxes -- This sentence is false -- The liar and Gödel -- Language and metalanguage -- The axiomatic method or how to get the non-obvious out of the obvious -- Peano's axioms -- And the unsatisfied logicists, Frege and Russell -- Bits of set theory -- The abstraction principle -- Bytes of set theory -- Properties, relations, functions, that is, sets again -- Calculating, computing, enumerating, that is, the notion of algorithm -- Taking numbers as sets of sets -- It's raining paradoxes -- Cantor's diagonal argument -- Self-reference and paradoxes -- Hilbert -- Strings of symbols -- In mathematics there is no ignorabimus -- Gödel on stage -- Our first encounter with the incompleteness theorem -- And some provisos -- Gödelization, or say it with numbers! -- TNT -- The arithmetical axioms of tnt and the standard model N -- The fundamental property of formal systems -- The Gödel numbering -- And the arithmetization of syntax --
505 0 $aBits of recursive arithmetic -- Making algorithms precise -- Bits of recursion theory -- Church's thesis -- The recursiveness of predicates, sets, properties, and relations -- And how it is represented in typographical number theory -- Introspection and representation -- The representability of properties, relations, and functions -- And the Gödelian loop -- I am not provable -- Proof pairs -- The property of being a theorem of TNI (is not recursive!) -- Arithmetizing substitution -- How can a TNT sentence refer to itself? -- Fixed point -- Consistency and omega-consistency -- Proving G1 -- Rosser's proof -- The unprovability of consistency and the immediate consequences of G1 and -- G2 -- Technical interlude -- Immediate consequences of G1 and G2 -- Undecidable1 and undecidable 2 -- Essential incompleteness, or the syndicate of mathematicians -- Robinson arithmetic -- How general are Gödel's results? -- Bits of turing machine -- G1 and G2 in general --
505 0 $aUnexpected fish in the formal net -- Supernatural numbers -- The culpability of the induction scheme -- Bits of truth (not too much of it, though) -- The world after Gödel -- Bourgeois mathematicians! : the postmodern interpretations -- What is postmodernism? -- From Gödel to Lenin -- Is biblical proof decidable? -- Speaking of the totality -- Bourgeois teachers! -- (un)interesting bifurcations -- A footnote to Plato -- Explorers in the realm of numbers -- The essence of a life -- The philosophical prejudices of our times -- From Gödel to Tarski -- Human, too human -- Mathematical faith -- I'm not crazy! -- Qualified doubts -- From gentzen to the dialectica interpretation -- Mathematicians are people of faith -- Mind versus computer : Gödel and artificial intelligence -- Is mind (just) a program? -- Seeing the truth and going outside the system -- The basic mistake -- In the haze of the transfinite -- Know thyself : Socrates and the inexhaustibility of mathematics --
505 0 $aGödel versus wittgenstein and the paraconsistent interpretation -- When geniuses meet -- The implausible Wittgenstein -- There is no metamathematics -- Proof and prose -- The single argument -- But how can arithmetic be inconsistent? -- The costs and benefits of making Wittgenstein plausible.
520 $aThere's Something About Gödel is a lucid and accessible guide to Gödel's revolutionary Incompleteness Theorem, considered one of the most astounding argumentative sequences in the history of human thought. It is also an exploration of the most controversial alleged philosophical outcomes of the Theorem. Divided into two parts, the first section introduces the reader to the Incompleteness Theorem--the argument that all mathematical systems contain statements which are true, yet which cannot be proved within the system. Berto describes the historical context surrounding Gödel's accomplishment, explains step-by-step the key aspects of the Theorem, and explores the technical issues of incompleteness in formal logical systems. The second half, The World After Gödel, considers some of the most famous--and infamous--claims arising from Gödel's theorem in the areas of the philosophy of mathematics, metaphysics, the philosophy of mind, Artificial Intelligence, and even sociology and politics. This book requires only minimal knowledge of aspects of elementary logic, and is written in a user-friendly style that enables it to be read by those outside the academic field, as well as students of philosophy, logic, and computing.
650 0 $aIncompleteness theorem.
650 0 $aGödel's theorem.
650 0 $aMathematics$xPhilosophy.
600 10 $aGödel, Kurt.
650 0 $aIncompleteness theorems.
988 $a20100111
906 $0DLC