Tell your friends about this item:
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library 1999 edition
Roman Murawski
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library 1999 edition
Roman Murawski
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
See all of Roman Murawski ( e.g. Hardcover Book and Paperback Book )