Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
130,30 €*
Versandkostenfrei per Post / DHL
Aktuell nicht verfügbar
Kategorien:
Beschreibung
Computability and Logic is a classic because of its accessibility to students without a mathematical background.
Computability and Logic is a classic because of its accessibility to students without a mathematical background.
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: | 2012 |
---|---|
Fachbereich: | Grundlagen |
Genre: | Mathematik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Buch |
Inhalt: | Gebunden |
ISBN-13: | 9780521877527 |
ISBN-10: | 0521877520 |
Sprache: | Englisch |
Ausstattung / Beilage: | HC gerader Rücken kaschiert |
Einband: | Gebunden |
Autor: |
Boolos, George S.
Burgess, John P. Jeffrey, Richard C. |
Auflage: | 5. Auflage |
Hersteller: | Cambridge University Press |
Maße: | 260 x 183 x 24 mm |
Von/Mit: | George S. Boolos (u. a.) |
Erscheinungsdatum: | 18.01.2012 |
Gewicht: | 0,885 kg |
Inhaltsverzeichnis
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.
Details
Erscheinungsjahr: | 2012 |
---|---|
Fachbereich: | Grundlagen |
Genre: | Mathematik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Buch |
Inhalt: | Gebunden |
ISBN-13: | 9780521877527 |
ISBN-10: | 0521877520 |
Sprache: | Englisch |
Ausstattung / Beilage: | HC gerader Rücken kaschiert |
Einband: | Gebunden |
Autor: |
Boolos, George S.
Burgess, John P. Jeffrey, Richard C. |
Auflage: | 5. Auflage |
Hersteller: | Cambridge University Press |
Maße: | 260 x 183 x 24 mm |
Von/Mit: | George S. Boolos (u. a.) |
Erscheinungsdatum: | 18.01.2012 |
Gewicht: | 0,885 kg |
Warnhinweis