Recursive Functions and Metamathematics - Problems of Completeness and Decidability, Goedel's Theorems (Hardcover, 1999 ed.)

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.

General

Imprint:	Springer
Country of origin:	Netherlands
Series:	Synthese Library, 286
Release date:	September 1999
First published:	September 1999
Authors:	Roman Murawski
Dimensions:	234 x 156 x 23mm (L x W x T)
Format:	Hardcover
Pages:	395
Edition:	1999 ed.
ISBN-13:	978-0-7923-5904-3
Categories:	Books > Science & Mathematics > Mathematics > Philosophy of mathematics Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Promotions
LSN:	0-7923-5904-6
Barcode:	9780792359043

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!