My Wish Lists Login / Join

Synthese Library

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

By: Roman Murawski

Write A Review

Hardcover | 30 September 1999

At a Glance

Hardcover
412 Pages

Dimensions(cm)
23.5 x 15.88 x 3.18

Hardcover

$249.00

or 4 interest-free payments of $62.25 with

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Mathematics Mathematical Foundation Mathematical Logic Philosophy Philosophy & Logic Philosophy of Mathematics Science Science in General Philosophy of Science Computing & I.T.Computer Science

Mathematical Theory of Computation

Other Editions and Formats

Paperback

Published: 6th December 2010

View Product

Preface
Introduction	p. 1
Recursive Functions	p. 19
Computable Functions	p. 19
Recursive Functions	p. 21
Markov Algorithms and Turing Machines	p. 39
Primitive and Elementary Recursive Functions	p. 51
Arithmetical Hierarchy	p. 75
Church's Thesis	p. 84
Historical Remarks	p. 90
Godel's Incompleteness Theorems	p. 97
Arithmetic of Natural Numbers	p. 97
Representability in Peano Arithmetic	p. 103
Arithmetization of Syntax	p. 116
Godel's Theorems	p. 127
Paris-Harrington and Paris-Kirby Theorems	p. 157
Satisfaction and Consistency	p. 173
Historical Remarks	p. 196
Decidability Theory	p. 211
Basic notions and theorems	p. 211
Decidable Theories	p. 217
Undecidable Theories	p. 245
Historical Remarks	p. 275
Philosophical Comments	p. 281
Direct Consequences of Godel's Results	p. 281
Godel's Theorems vs. Hilbert's Program	p. 303
Generalized Hilbert's Program	p. 311
Relativized Hilbert's Program vs. Reverse Mathematics	p. 314
Hilbert's Tenth Problem	p. 323
Godel's Theorems and Computer Science	p. 325
Godel's Theorems and General Philosophy	p. 337
Conclusions	p. 338
Bibliography	p. 341
List of Symbols	p. 377
Index	p. 383
Table of Contents provided by Blackwell. All Rights Reserved.

Synthese Library

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

At a Glance

Hardcover

Shipping

How to return your order

Defective items

You Can Find This Book In

Other Editions and Formats

Paperback

More in Mathematical Theory of Computation

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Discrete Mathematics for Computing

Grassroots

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

Effective Machine Learning Teams

Best Practices for ML Practitioners

Decentralized Futures

Navigating the Integration of Blockchain Technology with Artificial Intelligence

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

Nonlinear Analysis for Human Movement Variability

Introduction to Modern Cryptography

Revised Third Edition

Machine Learning Interviews

Kickstart Your Machine Learning and Data Career

Beading With Algorithms

Cellular Automata In Peyote Stitch

Beading With Algorithms

Cellular Automata In Peyote Stitch

Ten Software Patterns Every Student Should Know

The Indeterminacy of Computation

Elements in the Philosophy of Mathematics

The Indeterminacy of Computation

Elements in the Philosophy of Mathematics

Computability and Computational Explanation

Elements in the Philosophy of Mathematics

Applied Mathematics with F#

Linear Algebra with Applications in Machine Learning

From Intuitive Understanding to Python Coding

Graphical Models and Causal Discovery with Python

100 Exercises for Building Logic

Axiomatic Set Theory

An Introduction

Tools for High Performance Computing 2024

Proceedings of the 15th International Workshop on Parallel Tools for High Performance Computing

AI Value Creators

Beyond the Generative AI User Mindset

AI Engineering

Building Applications with Foundation Models

This product is categorised by