Computability and logic:
This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic b...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | , |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2002
|
| Ausgabe: | Fourth edition. |
| Links: | https://doi.org/10.1017/CBO9781139164931 |
| Zusammenfassung: | This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book 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. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer. |
| Umfang: | 1 Online-Ressource (xi, 356 Seiten) |
| ISBN: | 9781139164931 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781139164931 | ||
| 003 | UkCbUP | ||
| 005 | 20160223144024.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 111007s2002||||enk o ||1 0|eng|d | ||
| 020 | |a 9781139164931 | ||
| 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 Fourth edition. | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2002 | |
| 300 | |a 1 Online-Ressource (xi, 356 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 520 | |a This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book 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. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer. | ||
| 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 9780521007580 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521809757 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9781139164931 |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-CR9781139164931 |
|---|---|
| _version_ | 1825574051925458944 |
| 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 | Fourth edition. |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01809nam a2200301 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781139164931</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20160223144024.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">111007s2002||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139164931</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">Fourth edition.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xi, 356 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">This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book 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. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer.</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">9780521007580</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">9780521809757</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/CBO9781139164931</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-CR9781139164931 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:06Z |
| institution | BVB |
| isbn | 9781139164931 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xi, 356 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Boolos, George Computability and logic George S. Boolos, John P. Burgess, Richard C. Jeffrey Computability & Logic Fourth edition. Cambridge Cambridge University Press 2002 1 Online-Ressource (xi, 356 Seiten) txt c cr This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book 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. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer. Burgess, John P. 1948- Jeffrey, Richard C. Erscheint auch als Druck-Ausgabe 9780521007580 Erscheint auch als Druck-Ausgabe 9780521809757 |
| 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 |