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:
Hauptverfasser: | , , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge
Cambridge University Press
2002
|
Ausgabe: | Fourth edition |
Schlagworte: | |
Online-Zugang: | BSB01 FHN01 UBG01 UBM01 Volltext |
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 |
Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
Beschreibung: | 1 online resource (xi, 356 pages) |
ISBN: | 9781139164931 |
DOI: | 10.1017/CBO9781139164931 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV043924386 | ||
003 | DE-604 | ||
005 | 20180223 | ||
007 | cr|uuu---uuuuu | ||
008 | 161202s2002 |||| o||u| ||||||eng d | ||
020 | |a 9781139164931 |c Online |9 978-1-139-16493-1 | ||
024 | 7 | |a 10.1017/CBO9781139164931 |2 doi | |
035 | |a (ZDB-20-CBO)CR9781139164931 | ||
035 | |a (OCoLC)967413437 | ||
035 | |a (DE-599)BVBBV043924386 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-473 |a DE-92 |a DE-19 | ||
082 | 0 | |a 511.3 |2 21 | |
084 | |a CC 2600 |0 (DE-625)17610: |2 rvk | ||
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
100 | 1 | |a Boolos, George |d 1940-1996 |e Verfasser |0 (DE-588)171984196 |4 aut | |
245 | 1 | 0 | |a Computability and logic |c George S. Boolos, John P. Burgess, Richard C. Jeffrey |
246 | 1 | 3 | |a Computability & Logic |
250 | |a Fourth edition | ||
264 | 1 | |a Cambridge |b Cambridge University Press |c 2002 | |
300 | |a 1 online resource (xi, 356 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
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 | ||
650 | 4 | |a Computable functions | |
650 | 4 | |a Recursive functions | |
650 | 4 | |a Logic, Symbolic and mathematical | |
650 | 0 | 7 | |a Mathematische Logik |0 (DE-588)4037951-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
689 | 0 | 1 | |a Mathematische Logik |0 (DE-588)4037951-6 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
700 | 1 | |a Burgess, John P. |d 1948- |e Verfasser |0 (DE-588)139005250 |4 aut | |
700 | 1 | |a Jeffrey, Richard C. |d 1926-2002 |e Verfasser |0 (DE-588)119344491 |4 aut | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 978-0-521-80975-7 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-0-521-00758-0 |
856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781139164931 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-20-CBO | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-029333465 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1017/CBO9781139164931 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9781139164931 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9781139164931 |l UBG01 |p ZDB-20-CBO |q UBG_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9781139164931 |l UBM01 |p ZDB-20-CBO |q UBM_PDA_CBO_Kauf |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804176849542053888 |
---|---|
any_adam_object | |
author | Boolos, George 1940-1996 Burgess, John P. 1948- Jeffrey, Richard C. 1926-2002 |
author_GND | (DE-588)171984196 (DE-588)139005250 (DE-588)119344491 |
author_facet | Boolos, George 1940-1996 Burgess, John P. 1948- Jeffrey, Richard C. 1926-2002 |
author_role | aut aut aut |
author_sort | Boolos, George 1940-1996 |
author_variant | g b gb j p b jp jpb r c j rc rcj |
building | Verbundindex |
bvnumber | BV043924386 |
classification_rvk | CC 2600 SK 130 |
collection | ZDB-20-CBO |
ctrlnum | (ZDB-20-CBO)CR9781139164931 (OCoLC)967413437 (DE-599)BVBBV043924386 |
dewey-full | 511.3 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3 |
dewey-search | 511.3 |
dewey-sort | 3511.3 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik Philosophie |
doi_str_mv | 10.1017/CBO9781139164931 |
edition | Fourth edition |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03466nmm a2200589zc 4500</leader><controlfield tag="001">BV043924386</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180223 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161202s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139164931</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-139-16493-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781139164931</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781139164931</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967413437</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043924386</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-19</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">CC 2600</subfield><subfield code="0">(DE-625)17610:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Boolos, George</subfield><subfield code="d">1940-1996</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)171984196</subfield><subfield code="4">aut</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="1" ind2="3"><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 resource (xi, 356 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</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="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mathematische Logik</subfield><subfield code="0">(DE-588)4037951-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Burgess, John P.</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)139005250</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jeffrey, Richard C.</subfield><subfield code="d">1926-2002</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)119344491</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">978-0-521-80975-7</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-0-521-00758-0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781139164931</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029333465</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139164931</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139164931</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139164931</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBG_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139164931</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBM_PDA_CBO_Kauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV043924386 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:38:43Z |
institution | BVB |
isbn | 9781139164931 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029333465 |
oclc_num | 967413437 |
open_access_boolean | |
owner | DE-12 DE-473 DE-BY-UBG DE-92 DE-19 DE-BY-UBM |
owner_facet | DE-12 DE-473 DE-BY-UBG DE-92 DE-19 DE-BY-UBM |
physical | 1 online resource (xi, 356 pages) |
psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO UBG_PDA_CBO ZDB-20-CBO UBM_PDA_CBO_Kauf |
publishDate | 2002 |
publishDateSearch | 2002 |
publishDateSort | 2002 |
publisher | Cambridge University Press |
record_format | marc |
spelling | Boolos, George 1940-1996 Verfasser (DE-588)171984196 aut Computability and logic George S. Boolos, John P. Burgess, Richard C. Jeffrey Computability & Logic Fourth edition Cambridge Cambridge University Press 2002 1 online resource (xi, 356 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) 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 Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 s Mathematische Logik (DE-588)4037951-6 s 1\p DE-604 Burgess, John P. 1948- Verfasser (DE-588)139005250 aut Jeffrey, Richard C. 1926-2002 Verfasser (DE-588)119344491 aut Erscheint auch als Druck-Ausgabe, Hardcover 978-0-521-80975-7 Erscheint auch als Druck-Ausgabe, Paperback 978-0-521-00758-0 https://doi.org/10.1017/CBO9781139164931 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Boolos, George 1940-1996 Burgess, John P. 1948- Jeffrey, Richard C. 1926-2002 Computability and logic Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
subject_GND | (DE-588)4037951-6 (DE-588)4138368-0 |
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 |
topic | Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
topic_facet | Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik Berechenbarkeit |
url | https://doi.org/10.1017/CBO9781139164931 |
work_keys_str_mv | AT boolosgeorge computabilityandlogic AT burgessjohnp computabilityandlogic AT jeffreyrichardc computabilityandlogic AT boolosgeorge computabilitylogic AT burgessjohnp computabilitylogic AT jeffreyrichardc computabilitylogic |