Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems: 286 (Synthese Library, 286) - Image 1

£117.58

Springer Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems: 286 (Synthese Library, 286)

Name: Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Godel's Theorems: 286 (Synthese Library, 286)
Brand: Springer
Price: 117.58 GBP
Availability: InStock

Computer Science

Price History & Forecast

Last 4 days • 4 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 4 days • 1 price levels

Days at Price

Price Analysis

Most common price: £118 (4 days, 100.0%)

Price range: £118 - £118

Price levels: 1 different prices over 4 days

Description

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.

Product Specifications

Brand: Springer
Format: Paperback
ASIN: 9048152984
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 06 December 2010
Listed Since: 14 June 2010

Barcode

No barcode data available

Springer Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems: 286 (Synthese Library, 286)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Inexhaustibility: A Non-Exhaustive Treatment: Lecture Notes in Logic 16

The Theory of Gödel: 470 (Synthese Library, 470)

The Theory of Gödel: 470 (Synthese Library, 470)

Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)

Computability

Computability: An Introduction to Recursive Function Theory

Mathematics in Programming

Computability Theory: An Introduction to Recursion Theory

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Recursion Theory, Godel's Theorems, Set Theory, Model Theory (Mathematical Logic: A Course With Exercises, Part II)

Mathematical Logic and Formalized Theories: A Survey of Basic Concepts and Results

Introduction to Incompleteness: From Gödel's Theorems to Forcing and the Continuum Hypothesis

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

Logic of Mathematics: A Modern Course of Classical Logic: 22 (Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts)

Constructive Models (Siberian School of Algebra and Logic)

Logic and Combinatorics: Joint Summer Research Conference on Applications of Mathematical Logic to Finite Combinatorics (Contemporary Mathematics)

Gödel's Theorems and Zermelo's Axioms: A Firm Foundation of Mathematics

Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers: Volume 125 (Studies in Logic and the Foundations of Mathematics, Volume 125)

Gödel's Theorems and Zermelo's Axioms: A Firm Foundation of Mathematics

Gödel's Incompleteness Theorems: A Guided Tour Through Kurt Gödel’s Historic Proof

Metamathematics of First-Order Arithmetic (Perspectives in Mathematical Logic)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Springer - Reverse Mathematics: Problems, Reductions, and Proofs

Truth, Proof and Infinity: A Theory of Constructive Reasoning: 276 (Synthese Library, 276)