Undecidable Theories: Studies in Logic and the Foundation of MathematicsPaperback Dover Books on Mathematics
List price $21.53
You save $10.57 49% off
Free delivery worldwide
Dispatched in 3 business days
When will my order arrive?
- Publisher: Dover Publications Inc.
- Format: Paperback | 112 pages
- Dimensions: 135mm x 208mm x 8mm | 136g
- Publication date: 24 September 2010
- Publication City/Country: New York
- ISBN 10: 0486477037
- ISBN 13: 9780486477039
- Edition statement: Dover.
- Sales rank: 249,496
This graduate-level book is well known for its proof that many mathematical systems--including lattice theory, abstract projective geometry, and closure algebras--are undecidable. Based on research conducted from 1938 to 1952, it consists of three treatises by a prolific author who ranks among the greatest logicians of all time. The first article, "A General Method in Proofs of Undecidability," examines theories with standard formalization, undecidable theories, interpretability, and relativization of quantifiers. The second feature, "Undecidability and Essential Undecidability in Mathematics," explores definability in arbitrary theories and the formalized arithmetic of natural numbers. It also considers recursiveness, definability, and undecidability in subtheories of arithmetic as well as the extension of results to other arithmetical theories. The compilation concludes with "Undecidability of the Elementary Theory of Groups."
Other people who viewed this bought:
USD$8.94 - Save $6.44 41% off - RRP $15.38
USD$10.94 - Save $10.59 49% off - RRP $21.53
USD$49.67 - Save $5.73 10% off - RRP $55.40
USD$12.88 - Save $2.44 15% off - RRP $15.32
Other books in this category
USD$22.29 - Save $2.32 (9%) - RRP $24.61
USD$9.08 - Save $3.22 26% off - RRP $12.30
USD$11.51 - Save $3.44 23% off - RRP $14.95
USD$10.99 - Save $4.39 28% off - RRP $15.38
USD$10.44 - Save $8.79 45% off - RRP $19.23
USD$31.72 - Save $5.21 14% off - RRP $36.93
Table of contents
I. A General Method in Proofs of Undecidability by Alfred Tarski I.1. Introduction I.2. Theories with standard formalization I.3. Undecidable and essentially undecidable theories I.4. Interpretability and weak interpretability I.5. Relativization of quantifiers I.6. Examples and applications II. Undecidability and Essential Undecidability in Arithmetic by Andrzej Mostowski, Raphael M. Robinson, and Alfred Tarski II.1. A summary of results; notation II.2. Definability in arbitrary theories II.3. Formalized arithmetic of natural numbers and its subtheories II.4. Recursiveness and definability in subtheories of arithmetic II.5. Undecidability of subtheories of arithmetic II.6. Extension of the results to other arithmetical theories and to various theories of rings III. Undecidability of the Elementary Theory of Groups by Alfred Tarski Bibliography Index