Computability and logic:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2002
|
| Ausgabe: | 4th ed. , George S. Boolos, John P. Burgess, Richard C. Jeffrey |
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | Includes bibliographical references (page 348) and index Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; 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; Basic Metalogic; 9 A Précis of First-Order Logic: Syntax; 10 A Précis 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 Now in its fourth edition, this book has become a classic because it covers not simply the staple topics of intermediate logic courses but also a large number of other topics. John Burgess has enhanced the book by adding problems at the end of each chapter and by rewriting chapters |
| Beschreibung: | 1 Online-Ressource (xi, 356 pages) |
| ISBN: | 0511076495 0511078064 0521007585 0521809754 1139164937 9780511076497 9780511078064 9780521007580 9780521809757 9781139164931 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043077444 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151126s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 0511076495 |c electronic bk. : Adobe Reader |9 0-511-07649-5 | ||
| 020 | |a 0511078064 |c electronic bk. |9 0-511-07806-4 | ||
| 020 | |a 0521007585 |9 0-521-00758-5 | ||
| 020 | |a 0521809754 |9 0-521-80975-4 | ||
| 020 | |a 1139164937 |c electronic bk. |9 1-139-16493-7 | ||
| 020 | |a 9780511076497 |c electronic bk. : Adobe Reader |9 978-0-511-07649-7 | ||
| 020 | |a 9780511078064 |c electronic bk. |9 978-0-511-07806-4 | ||
| 020 | |a 9780521007580 |9 978-0-521-00758-0 | ||
| 020 | |a 9780521809757 |9 978-0-521-80975-7 | ||
| 020 | |a 9781139164931 |c electronic bk. |9 978-1-139-16493-1 | ||
| 035 | |a (OCoLC)57417424 | ||
| 035 | |a (DE-599)BVBBV043077444 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 511.3 |2 22 | |
| 100 | 1 | |a Boolos, George |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computability and logic |
| 250 | |a 4th ed. , George S. Boolos, John P. Burgess, Richard C. Jeffrey | ||
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2002 | |
| 300 | |a 1 Online-Ressource (xi, 356 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references (page 348) and index | ||
| 500 | |a Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; 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; Basic Metalogic; 9 A Précis of First-Order Logic: Syntax; 10 A Précis 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 | ||
| 500 | |a Now in its fourth edition, this book has become a classic because it covers not simply the staple topics of intermediate logic courses but also a large number of other topics. John Burgess has enhanced the book by adding problems at the end of each chapter and by rewriting chapters | ||
| 650 | 7 | |a MATHEMATICS / Infinity |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / Logic |2 bisacsh | |
| 650 | 7 | |a Logica |2 gtt | |
| 650 | 7 | |a Berekenbaarheid |2 gtt | |
| 650 | 4 | |a Logik | |
| 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. |e Sonstige |4 oth | |
| 700 | 1 | |a Jeffrey, Richard C. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=125077 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028501636 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=125077 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=125077 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175466291003392 |
|---|---|
| any_adam_object | |
| author | Boolos, George |
| author_facet | Boolos, George |
| author_role | aut |
| author_sort | Boolos, George |
| author_variant | g b gb |
| building | Verbundindex |
| bvnumber | BV043077444 |
| collection | ZDB-4-EBA |
| ctrlnum | (OCoLC)57417424 (DE-599)BVBBV043077444 |
| 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 |
| edition | 4th ed. , George S. Boolos, John P. Burgess, Richard C. Jeffrey |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03558nmm a2200661zc 4500</leader><controlfield tag="001">BV043077444</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511076495</subfield><subfield code="c">electronic bk. : Adobe Reader</subfield><subfield code="9">0-511-07649-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511078064</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-511-07806-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521007585</subfield><subfield code="9">0-521-00758-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521809754</subfield><subfield code="9">0-521-80975-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139164937</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">1-139-16493-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511076497</subfield><subfield code="c">electronic bk. : Adobe Reader</subfield><subfield code="9">978-0-511-07649-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511078064</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-511-07806-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521007580</subfield><subfield code="9">978-0-521-00758-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521809757</subfield><subfield code="9">978-0-521-80975-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139164931</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-1-139-16493-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)57417424</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043077444</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Boolos, George</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability and logic</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">4th ed. , George S. Boolos, John P. Burgess, Richard C. Jeffrey</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 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">Includes bibliographical references (page 348) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; 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; Basic Metalogic; 9 A Précis of First-Order Logic: Syntax; 10 A Précis 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</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Now in its fourth edition, this book has become a classic because it covers not simply the staple topics of intermediate logic courses but also a large number of other topics. John Burgess has enhanced the book by adding problems at the end of each chapter and by rewriting chapters</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Infinity</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Logic</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logica</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Berekenbaarheid</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logik</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="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jeffrey, Richard C.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=125077</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028501636</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">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=125077</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=125077</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043077444 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:16:44Z |
| institution | BVB |
| isbn | 0511076495 0511078064 0521007585 0521809754 1139164937 9780511076497 9780511078064 9780521007580 9780521809757 9781139164931 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028501636 |
| oclc_num | 57417424 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 Online-Ressource (xi, 356 pages) |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Boolos, George Verfasser aut Computability and logic 4th ed. , George S. Boolos, John P. Burgess, Richard C. Jeffrey Cambridge Cambridge University Press 2002 1 Online-Ressource (xi, 356 pages) txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references (page 348) and index Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; 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; Basic Metalogic; 9 A Précis of First-Order Logic: Syntax; 10 A Précis 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 Now in its fourth edition, this book has become a classic because it covers not simply the staple topics of intermediate logic courses but also a large number of other topics. John Burgess has enhanced the book by adding problems at the end of each chapter and by rewriting chapters MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Logica gtt Berekenbaarheid gtt Logik 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. Sonstige oth Jeffrey, Richard C. Sonstige oth http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=125077 Aggregator Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Boolos, George Computability and logic MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Logica gtt Berekenbaarheid gtt Logik 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_auth | Computability and logic |
| title_exact_search | Computability and logic |
| title_full | Computability and logic |
| title_fullStr | Computability and logic |
| title_full_unstemmed | Computability and logic |
| title_short | Computability and logic |
| title_sort | computability and logic |
| topic | MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Logica gtt Berekenbaarheid gtt Logik Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik (DE-588)4037951-6 gnd Berechenbarkeit (DE-588)4138368-0 gnd |
| topic_facet | MATHEMATICS / Infinity MATHEMATICS / Logic Logica Berekenbaarheid Logik Computable functions Recursive functions Logic, Symbolic and mathematical Mathematische Logik Berechenbarkeit |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=125077 |
| work_keys_str_mv | AT boolosgeorge computabilityandlogic AT burgessjohnp computabilityandlogic AT jeffreyrichardc computabilityandlogic |