Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
42,70 €*
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
Kategorien:
Beschreibung
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âEUR(TM)s theory of computability to RamseyâEUR(TM)s theorem.
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âEUR(TM)s theory of computability to RamseyâEUR(TM)s theorem.
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: | 2007 |
---|---|
Fachbereich: | Allgemeines |
Genre: | Importe, Philosophie |
Jahrhundert: | Antike |
Rubrik: | Geisteswissenschaften |
Thema: | Lexika |
Medium: | Taschenbuch |
ISBN-13: | 9780521701464 |
ISBN-10: | 0521701465 |
Sprache: | Englisch |
Ausstattung / Beilage: | Paperback |
Einband: | Kartoniert / Broschiert |
Autor: |
Boolos, George
Burgess, John P. Jeffrey, Richard C. |
Auflage: | 5. Auflage |
Hersteller: | Cambridge University Press |
Verantwortliche Person für die EU: | Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de |
Maße: | 254 x 178 x 20 mm |
Von/Mit: | George Boolos (u. a.) |
Erscheinungsdatum: | 01.10.2007 |
Gewicht: | 0,688 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: | 2007 |
---|---|
Fachbereich: | Allgemeines |
Genre: | Importe, Philosophie |
Jahrhundert: | Antike |
Rubrik: | Geisteswissenschaften |
Thema: | Lexika |
Medium: | Taschenbuch |
ISBN-13: | 9780521701464 |
ISBN-10: | 0521701465 |
Sprache: | Englisch |
Ausstattung / Beilage: | Paperback |
Einband: | Kartoniert / Broschiert |
Autor: |
Boolos, George
Burgess, John P. Jeffrey, Richard C. |
Auflage: | 5. Auflage |
Hersteller: | Cambridge University Press |
Verantwortliche Person für die EU: | Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de |
Maße: | 254 x 178 x 20 mm |
Von/Mit: | George Boolos (u. a.) |
Erscheinungsdatum: | 01.10.2007 |
Gewicht: | 0,688 kg |
Sicherheitshinweis