- We will send in 10–14 business days.
/images/books/3603923/9780486477039.jpg)
- Author: Alfred Tarski
- Publisher: Dover Publications
- ISBN-10: 0486477037
- ISBN-13: 9780486477039
- Format: 13.5 x 20.8 x 1 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
The promotion ends in 
- Author: Alfred Tarski
- Publisher: Dover Publications
- ISBN-10: 0486477037
- ISBN-13: 9780486477039
- Format: 13.5 x 20.8 x 1 cm, minkšti viršeliai
- Language: English English
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.
Reviews