Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems
märts 2013 · Synthese Library 286. raamat · Springer Science & Business Media
5,0star
1 arvustusreport
E-raamat
395
lehekülge
reportHinnangud ja arvustused pole kinnitatud. Lisateave
Teave selle e-raamatu kohta
Recursive Functions and Metamathematics deals with problems of the completeness and decidability of theories, using as its main tool the theory of recursive functions. This theory is first introduced and discussed. Then Gödel's incompleteness theorems are presented, together with generalizations, strengthenings, and the decidability theory. The book also considers the historical and philosophical context of these issues and their philosophical and methodological consequences. Recent results and trends have been included, such as undecidable sentences of mathematical content, reverse mathematics. All the main results are presented in detail. The book is self-contained and presupposes only some knowledge of elementary mathematical logic. There is an extensive bibliography.
Readership: Scholars and advanced students of logic, mathematics, philosophy of science.
Readership: Scholars and advanced students of logic, mathematics, philosophy of science.
Hinnangud ja arvustused
5,0
1 arvustus
Hinnake seda e-raamatut
Andke meile teada, mida te arvate.
Lugemisteave
Nutitelefonid ja tahvelarvutid
Installige rakendus Google Play raamatud Androidile ja iPadile/iPhone'ile. See sünkroonitakse automaatselt teie kontoga ja see võimaldab teil asukohast olenemata lugeda nii võrgus kui ka võrguühenduseta.
Sülearvutid ja arvutid
Google Playst ostetud audioraamatuid saab kuulata arvuti veebibrauseris.
E-lugerid ja muud seadmed
E-tindi seadmetes (nt Kobo e-lugerid) lugemiseks peate faili alla laadima ja selle oma seadmesse üle kandma. Failide toetatud e-lugeritesse teisaldamiseks järgige üksikasjalikke abikeskuse juhiseid.
