Recursive Functions and Metamathematics

Problems of Completeness and Decidability, Gödel’s Theorems

By:

Roman Murawski

Format:

Hardback

Series:

Synthese Library,

Show Hide Adult Content

$451.00

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Free Delivery with Primate

Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $112.75 with Afterpay Learn more

6 weekly interest-free payments of $75.17 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

Around 17-27 June using International Courier

Description

This text 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 Godel'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.

Release date NZ

September 30th, 1999

Author

Roman Murawski

Audiences

Postgraduate, Research & Scholarly
Professional & Vocational
Undergraduate

Illustrations

XII, 395 p.

Pages

395

Series

Synthese Library,

Dimensions

156x234x23

ISBN-13

9780792359043

Product ID

2437697

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here