Muutke küpsiste eelistusi

E-raamat: Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Godel's Theorems

  • Formaat: PDF+DRM
  • Sari: Synthese Library 286
  • Ilmumisaeg: 14-Mar-2013
  • Kirjastus: Springer
  • Keel: eng
  • ISBN-13: 9789401728669
  • Formaat - PDF+DRM
  • Hind: 162,40 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: PDF+DRM
  • Sari: Synthese Library 286
  • Ilmumisaeg: 14-Mar-2013
  • Kirjastus: Springer
  • Keel: eng
  • ISBN-13: 9789401728669

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.
Preface vii
Introduction 1(18)
Recursive Functions
19(78)
Computable Functions
19(2)
Recursive Functions
21(18)
Markov Algorithms and Turing Machines
39(12)
Primitive and Elementary Recursive Functions
51(24)
Arithmetical Hierarchy
75(9)
Church's Thesis
84(6)
Historical Remarks
90(7)
Godel's Incompleteness Theorems
97(114)
Arithmetic of natural Numbers
97(6)
Representability in Peano Arithmetic
103(13)
Arithmetization of Syntax
116(11)
Godel's Theorems
127(30)
Paris-Harrington and Paris-Kirby Theorems
157(16)
Satisfaction and Consistency
173(23)
Historical Remarks
196(15)
Decidability Theory
211(70)
Basic notions and theorems
211(6)
Decidable Theories
217(28)
Undecidable Theories
245(30)
Historical Remarks
275(6)
Philosophical Comments
281(60)
Direct Consequences of Godel's Results
281(22)
Godel's Theorems vs. Hilbert's Program
303(8)
Generalized Hilbert's Program
311(3)
Relativized Hilbert's Program vs. Reverse Mathematics
314(9)
Hilbert's Tenth Problem
323(2)
Godel's Theorems and Computer Science
325(12)
Godel's Theorems and General Philosophy
337(1)
Conclusions
338(3)
Bibliography 341(36)
List of Symbols 377(6)
Index 383