Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library - Roman Murawski - Books - Springer - 9780792359043 - September 30, 1999
In case cover and title do not match, the title is correct

Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library 1999 edition

Roman Murawski

Price
A$ 265.49

Ordered from remote warehouse

Expected delivery Oct 29 - Nov 11
Add to your iMusic wish list

Also available as:

Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library 1999 edition

Recursive Functions and Metamathematics deals with problems of the completeness and decidability of theories, using as its main tool the theory of recursive functions. Recent results and trends have been included, such as undecidable sentences of mathematical content, reverse mathematics.


395 pages, biography

Media Books     Hardcover Book   (Book with hard spine and cover)
Released September 30, 1999
ISBN13 9780792359043
Publishers Springer
Pages 395
Dimensions 156 × 234 × 23 mm   ·   757 g
Language English  

Show all

More by Roman Murawski