Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Computability and Logic - George S. Boolos, John P. Burgess, Richard C. Jeffrey

Computability and Logic

Buch | Softcover
366 Seiten
2007 | 5th Revised edition
Cambridge University Press (Verlag)
978-0-521-70146-4 (ISBN)
CHF 54,10 inkl. MwSt
Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This fifth edition was first published in 2007.
Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual.

Part I. Computability Theory: 1. Enumerability; 2. Diagonalization; 3. Turing computability; 4. Uncomputability; 5. Abacus computability; 6. Recursive functions; 7. Recursive sets and relations; 8. Equivalent definitions of computability; Part II. Basic Metalogic: 9. A precis of first-order logic: syntax; 10. A precis of first-order logic: semantics; 11. The undecidability of first-order logic; 12. Models; 13. The existence of models; 14. Proofs and completeness; 15. Arithmetization; 16. Representability of recursive functions; 17. Indefinability, undecidability, incompleteness; 18. The unprovability of consistency; Part III. Further Topics: 19. Normal forms; 20. The Craig interpolation theorem; 21. Monadic and dyadic logic; 22. Second-order logic; 23. Arithmetical definability; 24. Decidability of arithmetic without multiplication; 25. Non-standard models; 26. Ramsey's theorem; 27. Modal logic and provability.

Erscheint lt. Verlag 17.9.2007
Zusatzinfo Worked examples or Exercises
Verlagsort Cambridge
Sprache englisch
Maße 178 x 254 mm
Gewicht 650 g
Themenwelt Geisteswissenschaften Philosophie Logik
Mathematik / Informatik Mathematik Logik / Mengenlehre
ISBN-10 0-521-70146-5 / 0521701465
ISBN-13 978-0-521-70146-4 / 9780521701464
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich

von Sandra Markewitz; Ansgar Lorenz

Buch | Softcover (2024)
Brill | Fink (Verlag)
CHF 27,85
ein Gegenentwurf zum kurzfristigen Denken : so werden wir zu den …

von Ari Wallach

Buch | Hardcover (2023)
REDLINE (Verlag)
CHF 27,90
eine logische Untersuchung

von Gottlob Frege; Uwe Voigt

Buch | Softcover (2024)
Phillip Reclam (Verlag)
CHF 7,25