Introduction to Mathematical Logic
Seiten
1987
|
3rd ed.
Kluwer Academic Publishers (Verlag)
978-0-534-06624-6 (ISBN)
Kluwer Academic Publishers (Verlag)
978-0-534-06624-6 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
This classic in the field is a compact introduction to some of the basic topics of mathematical logic. This edition contains many new examples and the notation has been updated throughout.
This classic in the field is a compact introduction to some of the basic topics of mathematical logic. Major changes in this edition include a new section on semantic trees; an expanded chapter on Axiomatic Set Theory; and full coverage of effective computability, where Turing computability is now the central notion and diagrams (flow-charts) are used to construct Turing machines. Recursion theory is covered in more detail, including the s-m-n theorem, the recursion theorem and Rice's Theorem. New sections on register machines and random access machines will be of special interest to computer science students. The proofs of the incompleteness theorems are now based on the Diagonalization Lemma and the text also covers Lob's Theorem and its connections with Godel's Second Theorem. This edition contains many new examples and the notation has been updated throughout. This book should be of interest to introductory courses for students of mathematics, philosophy, computer science and electrical engineering.
This classic in the field is a compact introduction to some of the basic topics of mathematical logic. Major changes in this edition include a new section on semantic trees; an expanded chapter on Axiomatic Set Theory; and full coverage of effective computability, where Turing computability is now the central notion and diagrams (flow-charts) are used to construct Turing machines. Recursion theory is covered in more detail, including the s-m-n theorem, the recursion theorem and Rice's Theorem. New sections on register machines and random access machines will be of special interest to computer science students. The proofs of the incompleteness theorems are now based on the Diagonalization Lemma and the text also covers Lob's Theorem and its connections with Godel's Second Theorem. This edition contains many new examples and the notation has been updated throughout. This book should be of interest to introductory courses for students of mathematics, philosophy, computer science and electrical engineering.
Introduction. The propositional calculus. Quantification theory. Formal number theory. Axiomatic set theory. Effective computability. Bibliography. Answers. Notation. Index.
| Zusatzinfo | illus |
|---|---|
| Verlagsort | Dordrecht |
| Sprache | englisch |
| Maße | 150 x 230 mm |
| Gewicht | 650 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre |
| ISBN-10 | 0-534-06624-0 / 0534066240 |
| ISBN-13 | 978-0-534-06624-6 / 9780534066246 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
World Scientific Publishing Co Pte Ltd (Verlag)
CHF 43,60
what we have that machines don't
Buch | Softcover (2024)
Profile Books Ltd (Verlag)
CHF 19,15
how simple questions lead us to mathematics’ deepest truths
Buch | Softcover (2024)
Profile Books Ltd (Verlag)
CHF 19,15
