Skip to main content

Recursive Functions and Metamathematics

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

  • Book
  • © 1999

Overview

Part of the book series: Synthese Library (SYLI, volume 286)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

Keywords

About this book

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.

Authors and Affiliations

  • Adam Mickiewicz University, Poznań, Poland

    Roman Murawski

Bibliographic Information

  • Book Title: Recursive Functions and Metamathematics

  • Book Subtitle: Problems of Completeness and Decidability, Gödel’s Theorems

  • Authors: Roman Murawski

  • Series Title: Synthese Library

  • DOI: https://doi.org/10.1007/978-94-017-2866-9

  • Publisher: Springer Dordrecht

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media Dordrecht 1999

  • Hardcover ISBN: 978-0-7923-5904-3Published: 30 September 1999

  • Softcover ISBN: 978-90-481-5298-8Published: 06 December 2010

  • eBook ISBN: 978-94-017-2866-9Published: 14 March 2013

  • Series ISSN: 0166-6991

  • Series E-ISSN: 2542-8292

  • Edition Number: 1

  • Number of Pages: XII, 395

  • Topics: Logic, Mathematical Logic and Foundations, Philosophy of Science, Theory of Computation

Publish with us