Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems

· Synthese Library Bog 286 · Springer Science & Business Media
5,0
1 anmeldelse
E-bog
395
Sider
Bedømmelser og anmeldelser verificeres ikke  Få flere oplysninger

Om denne e-bog

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.

Bedømmelser og anmeldelser

5,0
1 anmeldelse

Bedøm denne e-bog

Fortæl os, hvad du mener.

Oplysninger om læsning

Smartphones og tablets
Installer appen Google Play Bøger til Android og iPad/iPhone. Den synkroniserer automatisk med din konto og giver dig mulighed for at læse online eller offline, uanset hvor du er.
Bærbare og stationære computere
Du kan høre lydbøger, du har købt i Google Play via browseren på din computer.
e-læsere og andre enheder
Hvis du vil læse på e-ink-enheder som f.eks. Kobo-e-læsere, skal du downloade en fil og overføre den til din enhed. Følg den detaljerede vejledning i Hjælp for at overføre filerne til understøttede e-læsere.