عنوان
پدید آورنده
موضوع
رده
کتابخانه
محل استقرار
Iran
89-35
انگلیسی
\ Peter Smith
Cambridge
: Cambridge University Press
, 2007.
xiv, 361 p. ; 26 cm.
What Godel'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 -- Godel'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 Isaacson's conjecture -- Godel'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 problems -- The church-turing thesis -- Proving the thesis.
0
Logic, Symbolic and mathematical
Gödel, Kurt]
Smith , Peter
Iran
Majlis library of Iran
BL
129675
1
yes
