Get Free Shipping on orders over $79
Recursive Functions and Metamathematics : Problems of Completeness and Decidability, G¶del's Theorems - Roman Murawski

Recursive Functions and Metamathematics

Problems of Completeness and Decidability, G¶del's Theorems

By: Roman Murawski

Hardcover | 30 September 1999

At a Glance

Hardcover


$249.00

or 4 interest-free payments of $62.25 with

 or 

Ships in 5 to 7 business days

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.

Other Editions and Formats

Paperback

Published: 6th December 2010

More in Mathematical Logic

Current Trends in Automated Reasoning - Erika Bach
Handbook of Automated Reasoning - Rachel Phillips
Advances in Automated Reasoning - Rachel Phillips
Unequal : The Maths of When Things Do and Don't Add Up - Eugenia Cheng
The Language of Mathematics : The Stories behind the Symbols - Raul Rojas
Essays in Analysis : Routledge Revivals - Alice Ambrose
Mathematical Puzzles : Revised Edition - Peter  Winkler

RRP $56.99

$52.75

Fuzzy Logic : An Introductory Text - Lukas Brooks