Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library - Roman Murawski - Books - Springer - 9789048152988 - December 6, 2010
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 Softcover reprint of hardcover 1st ed. 1999 edition

Roman Murawski

Price
A$ 283.99

Ordered from remote warehouse

Expected delivery Dec 16 - 27
Christmas presents can be returned until 31 January

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Also available as:

Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Goedel's Theorems - Synthese Library Softcover reprint of hardcover 1st ed. 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.

407 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released December 6, 2010
ISBN13 9789048152988
Publishers Springer
Pages 395
Dimensions 155 × 235 × 21 mm   ·   566 g
Show all

More by Roman Murawski

See all of Roman Murawski ( e.g. Hardcover Book and Paperback Book )