Can I read Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems (Synthese Library, 286) on EtoBox?

Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems (Synthese Library, 286) by Roman Murawski is a nonfiction available to read on EtoBox.

What is Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems (Synthese Library, 286) about?

<p>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.<br> Readership: Scholars and advanced students of logic, mathematics, philosophy of science.</p>

Who reads Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems (Synthese Library, 286)?

Author

Roman Murawski

Publisher

Springer Netherlands

Published

2011

Language

EN

ISBN

9789401728669

Category

nonfiction

Subjects

Philosophy, Science, Mathematics