Computability and logic:
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 T...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | , |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2007
|
| Ausgabe: | Fifth edition. |
| Links: | https://doi.org/10.1017/CBO9780511804076 |
| Zusammenfassung: | 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. |
| Umfang: | 1 Online-Ressource (xiii, 350 Seiten) |
| ISBN: | 9780511804076 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511804076 | ||
| 003 | UkCbUP | ||
| 005 | 20160223144055.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 101021s2007||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511804076 | ||
| 100 | 1 | |a Boolos, George | |
| 245 | 1 | 0 | |a Computability and logic |c George S. Boolos, John P. Burgess , Richard C. Jeffrey |
| 246 | 3 | |a Computability & Logic | |
| 250 | |a Fifth edition. | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2007 | |
| 300 | |a 1 Online-Ressource (xiii, 350 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a 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. | ||
| 700 | 1 | |a Burgess, John P. |d 1948- | |
| 700 | 1 | |a Jeffrey, Richard C. | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521701464 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521877527 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511804076 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511804076 |
|---|---|
| _version_ | 1825574051924410368 |
| adam_text | |
| any_adam_object | |
| author | Boolos, George |
| author2 | Burgess, John P. 1948- Jeffrey, Richard C. |
| author2_role | |
| author2_variant | j p b jp jpb r c j rc rcj |
| author_facet | Boolos, George Burgess, John P. 1948- Jeffrey, Richard C. |
| author_role | |
| author_sort | Boolos, George |
| author_variant | g b gb |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| edition | Fifth edition. |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01683nam a2200301 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511804076</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20160223144055.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">101021s2007||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511804076</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Boolos, George</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability and logic</subfield><subfield code="c">George S. Boolos, John P. Burgess , Richard C. Jeffrey</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Computability & Logic</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Fifth edition.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiii, 350 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Burgess, John P.</subfield><subfield code="d">1948-</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jeffrey, Richard C.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521701464</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521877527</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511804076</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511804076 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:06Z |
| institution | BVB |
| isbn | 9780511804076 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xiii, 350 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Boolos, George Computability and logic George S. Boolos, John P. Burgess , Richard C. Jeffrey Computability & Logic Fifth edition. Cambridge Cambridge University Press 2007 1 Online-Ressource (xiii, 350 Seiten) txt c cr 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. Burgess, John P. 1948- Jeffrey, Richard C. Erscheint auch als Druck-Ausgabe 9780521701464 Erscheint auch als Druck-Ausgabe 9780521877527 |
| spellingShingle | Boolos, George Computability and logic |
| title | Computability and logic |
| title_alt | Computability & Logic |
| title_auth | Computability and logic |
| title_exact_search | Computability and logic |
| title_full | Computability and logic George S. Boolos, John P. Burgess , Richard C. Jeffrey |
| title_fullStr | Computability and logic George S. Boolos, John P. Burgess , Richard C. Jeffrey |
| title_full_unstemmed | Computability and logic George S. Boolos, John P. Burgess , Richard C. Jeffrey |
| title_short | Computability and logic |
| title_sort | computability and logic |
| work_keys_str_mv | AT boolosgeorge computabilityandlogic AT burgessjohnp computabilityandlogic AT jeffreyrichardc computabilityandlogic AT boolosgeorge computabilitylogic AT burgessjohnp computabilitylogic AT jeffreyrichardc computabilitylogic |