Computability and logic.:
This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but also optional topics that include Turing's theory of computability and Ramsey's theorem.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
2007.
|
| Ausgabe: | 5th ed. / |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but also optional topics that include Turing's theory of computability and Ramsey's theorem. |
| Beschreibung: | 1 online resource (xiii, 350 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (page 341) and index. |
| ISBN: | 9780511649448 0511649444 9780511804076 0511804075 9780511366055 0511366051 9786612389924 6612389923 1107086507 9781107086500 1107183057 9781107183056 0511573979 9780511573972 051136668X 9780511366680 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn667025668 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 100929s2007 enka ob 001 0 eng d | ||
| 040 | |a IDEBK |b eng |e pn |c IDEBK |d E7B |d IUP |d OCLCQ |d N$T |d REDDC |d OCLCQ |d CAMBR |d OCLCF |d YDXCP |d OCLCQ |d YDX |d OCLCO |d OCLCQ |d BUF |d UAB |d STF |d OCLCQ |d MM9 |d U3W |d OCLCQ |d K6U |d OCLCO |d INARC |d LUN |d VLY |d UKAHL |d AUD |d AJS |d LVT |d OCLCQ |d OCLCO |d UPM |d DKU |d OCLCQ |d UKBTH |d OCLCO |d DST |d OCLCQ |d OCLCO |d OCLCL |d SFB |d OCLCQ | ||
| 019 | |a 427396657 |a 648345825 |a 772525451 |a 817967209 |a 963328274 |a 1030121492 |a 1030140618 |a 1081060995 |a 1089410839 |a 1117488805 |a 1117876288 |a 1125933520 |a 1144256988 |a 1151155924 |a 1162226229 |a 1167212588 |a 1171436142 |a 1187195026 |a 1205227666 |a 1205405970 |a 1205469864 |a 1229537894 |a 1241924443 |a 1243380379 |a 1246232404 |a 1262566886 |a 1264790804 |a 1266783528 |a 1269063642 |a 1274015991 |a 1292400180 |a 1296539717 |a 1300679763 |a 1303358044 |a 1303520756 | ||
| 020 | |a 9780511649448 |q (electronic bk.) | ||
| 020 | |a 0511649444 |q (electronic bk.) | ||
| 020 | |a 9780511804076 |q (electronic bk.) | ||
| 020 | |a 0511804075 |q (electronic bk.) | ||
| 020 | |a 9780511366055 |q (electronic bk.) | ||
| 020 | |a 0511366051 |q (electronic bk.) | ||
| 020 | |a 9786612389924 |q (electronic bk.) | ||
| 020 | |a 6612389923 | ||
| 020 | |a 1107086507 | ||
| 020 | |a 9781107086500 | ||
| 020 | |a 1107183057 | ||
| 020 | |a 9781107183056 | ||
| 020 | |a 0511573979 | ||
| 020 | |a 9780511573972 | ||
| 020 | |a 051136668X |q (electronic bk.) | ||
| 020 | |a 9780511366680 | ||
| 020 | |z 9780521877527 |q (hbk.) | ||
| 020 | |z 0521877520 |q (hbk.) | ||
| 020 | |z 9780521701464 |q (pbk.) | ||
| 020 | |z 0521701465 |q (pbk.) | ||
| 035 | |a (OCoLC)667025668 |z (OCoLC)427396657 |z (OCoLC)648345825 |z (OCoLC)772525451 |z (OCoLC)817967209 |z (OCoLC)963328274 |z (OCoLC)1030121492 |z (OCoLC)1030140618 |z (OCoLC)1081060995 |z (OCoLC)1089410839 |z (OCoLC)1117488805 |z (OCoLC)1117876288 |z (OCoLC)1125933520 |z (OCoLC)1144256988 |z (OCoLC)1151155924 |z (OCoLC)1162226229 |z (OCoLC)1167212588 |z (OCoLC)1171436142 |z (OCoLC)1187195026 |z (OCoLC)1205227666 |z (OCoLC)1205405970 |z (OCoLC)1205469864 |z (OCoLC)1229537894 |z (OCoLC)1241924443 |z (OCoLC)1243380379 |z (OCoLC)1246232404 |z (OCoLC)1262566886 |z (OCoLC)1264790804 |z (OCoLC)1266783528 |z (OCoLC)1269063642 |z (OCoLC)1274015991 |z (OCoLC)1292400180 |z (OCoLC)1296539717 |z (OCoLC)1300679763 |z (OCoLC)1303358044 |z (OCoLC)1303520756 | ||
| 037 | |a 238992 |b MIL | ||
| 050 | 4 | |a QA9.59 |b .B66 2007 | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 082 | 7 | |a 511.3/52 |2 22 | |
| 084 | |a SK 130 |2 rvk | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Boolos, George. |0 http://id.loc.gov/authorities/names/n88137851 | |
| 245 | 1 | 0 | |a Computability and logic. |
| 250 | |a 5th ed. / |b George S. Boolos, John P. Burgess, Richard C. Jeffrey. | ||
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2007. | ||
| 300 | |a 1 online resource (xiii, 350 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 504 | |a Includes bibliographical references (page 341) and index. | ||
| 505 | 0 | |a Enumerability -- Diagonalization -- Turing Computability -- Uncomputability -- Abacus Computability -- Recursive Functions -- Recursive Sets and Relations -- Equivalent Definitions of Computability -- Precis of First-Order Logic: Syntax -- Precis of First-Order Logic: Semantics -- Undecidability of First-Order Logic -- Models -- Existence of Models -- Proofs and Completeness -- Arithmetization -- Representability of Recursive Functions -- Indefinability, Undecidability, Incompleteness -- Unprovability of Consistency -- Normal Forms -- Craig Interpolation Theorem -- Monadic and Dyadic Logic -- Second-Order Logic -- Arithmetical Definability -- Decidability of Arithmetic without Multiplication -- Nonstandard Models -- Ramsey's Theorem -- Modal Logic and Provability. | |
| 520 | |a This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but also optional topics that include Turing's theory of computability and Ramsey's theorem. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Computable functions. |0 http://id.loc.gov/authorities/subjects/sh85029469 | |
| 650 | 0 | |a Recursive functions. |0 http://id.loc.gov/authorities/subjects/sh85112014 | |
| 650 | 0 | |a Logic, Symbolic and mathematical. |0 http://id.loc.gov/authorities/subjects/sh85078115 | |
| 650 | 6 | |a Fonctions calculables. | |
| 650 | 6 | |a Fonctions récursives. | |
| 650 | 6 | |a Logique symbolique et mathématique. | |
| 650 | 7 | |a COMPUTERS |x Machine Theory. |2 bisacsh | |
| 650 | 7 | |a Computable functions |2 fast | |
| 650 | 7 | |a Logic, Symbolic and mathematical |2 fast | |
| 650 | 7 | |a Recursive functions |2 fast | |
| 650 | 7 | |a Berechenbarkeit |2 gnd |0 http://d-nb.info/gnd/4138368-0 | |
| 650 | 7 | |a Mathematische Logik |2 gnd |0 http://d-nb.info/gnd/4037951-6 | |
| 650 | 7 | |a Symbolisk logik. |2 sao | |
| 700 | 1 | |a Burgess, John P., |d 1948- |1 https://id.oclc.org/worldcat/entity/E39PBJvHh7CbKpWMmDmWWMctrq |0 http://id.loc.gov/authorities/names/n2001013661 | |
| 700 | 1 | |a Jeffrey, Richard C. |0 http://id.loc.gov/authorities/names/n82093546 | |
| 758 | |i has work: |a Computability and logic (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGGTkBXmHwmqmB7Bqpbxfy |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Boolos, George. |t Computability and logic. |b 5th ed. |d Cambridge ; New York : Cambridge University Press, 2007 |z 9780521877527 |w (DLC) 2007014225 |w (OCoLC)122526900 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=304603 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH37560536 | ||
| 938 | |a ebrary |b EBRY |n ebr10213909 | ||
| 938 | |a EBSCOhost |b EBSC |n 304603 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 238992 | ||
| 938 | |a Internet Archive |b INAR |n computabilitylog0000bool | ||
| 938 | |a YBP Library Services |b YANK |n 2764979 | ||
| 938 | |a YBP Library Services |b YANK |n 7365433 | ||
| 938 | |a YBP Library Services |b YANK |n 9246830 | ||
| 938 | |a YBP Library Services |b YANK |n 2812084 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn667025668 |
|---|---|
| _version_ | 1816881740932710400 |
| 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_GND | http://id.loc.gov/authorities/names/n88137851 http://id.loc.gov/authorities/names/n2001013661 http://id.loc.gov/authorities/names/n82093546 |
| 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 | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.59 .B66 2007 |
| callnumber-search | QA9.59 .B66 2007 |
| callnumber-sort | QA 19.59 B66 42007 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 130 |
| collection | ZDB-4-EBA |
| contents | Enumerability -- Diagonalization -- Turing Computability -- Uncomputability -- Abacus Computability -- Recursive Functions -- Recursive Sets and Relations -- Equivalent Definitions of Computability -- Precis of First-Order Logic: Syntax -- Precis of First-Order Logic: Semantics -- Undecidability of First-Order Logic -- Models -- Existence of Models -- Proofs and Completeness -- Arithmetization -- Representability of Recursive Functions -- Indefinability, Undecidability, Incompleteness -- Unprovability of Consistency -- Normal Forms -- Craig Interpolation Theorem -- Monadic and Dyadic Logic -- Second-Order Logic -- Arithmetical Definability -- Decidability of Arithmetic without Multiplication -- Nonstandard Models -- Ramsey's Theorem -- Modal Logic and Provability. |
| ctrlnum | (OCoLC)667025668 |
| dewey-full | 511.3/52 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/52 |
| dewey-search | 511.3/52 |
| dewey-sort | 3511.3 252 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 5th ed. / |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06177cam a2200925 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn667025668</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">100929s2007 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">IDEBK</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">IDEBK</subfield><subfield code="d">E7B</subfield><subfield code="d">IUP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">REDDC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CAMBR</subfield><subfield code="d">OCLCF</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDX</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">BUF</subfield><subfield code="d">UAB</subfield><subfield code="d">STF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">MM9</subfield><subfield code="d">U3W</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCO</subfield><subfield code="d">INARC</subfield><subfield code="d">LUN</subfield><subfield code="d">VLY</subfield><subfield code="d">UKAHL</subfield><subfield code="d">AUD</subfield><subfield code="d">AJS</subfield><subfield code="d">LVT</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">UPM</subfield><subfield code="d">DKU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKBTH</subfield><subfield code="d">OCLCO</subfield><subfield code="d">DST</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">427396657</subfield><subfield code="a">648345825</subfield><subfield code="a">772525451</subfield><subfield code="a">817967209</subfield><subfield code="a">963328274</subfield><subfield code="a">1030121492</subfield><subfield code="a">1030140618</subfield><subfield code="a">1081060995</subfield><subfield code="a">1089410839</subfield><subfield code="a">1117488805</subfield><subfield code="a">1117876288</subfield><subfield code="a">1125933520</subfield><subfield code="a">1144256988</subfield><subfield code="a">1151155924</subfield><subfield code="a">1162226229</subfield><subfield code="a">1167212588</subfield><subfield code="a">1171436142</subfield><subfield code="a">1187195026</subfield><subfield code="a">1205227666</subfield><subfield code="a">1205405970</subfield><subfield code="a">1205469864</subfield><subfield code="a">1229537894</subfield><subfield code="a">1241924443</subfield><subfield code="a">1243380379</subfield><subfield code="a">1246232404</subfield><subfield code="a">1262566886</subfield><subfield code="a">1264790804</subfield><subfield code="a">1266783528</subfield><subfield code="a">1269063642</subfield><subfield code="a">1274015991</subfield><subfield code="a">1292400180</subfield><subfield code="a">1296539717</subfield><subfield code="a">1300679763</subfield><subfield code="a">1303358044</subfield><subfield code="a">1303520756</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511649448</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511649444</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511804076</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511804075</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511366055</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511366051</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786612389924</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6612389923</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107086507</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107086500</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107183057</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107183056</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511573979</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511573972</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">051136668X</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511366680</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521877527</subfield><subfield code="q">(hbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521877520</subfield><subfield code="q">(hbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521701464</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521701465</subfield><subfield code="q">(pbk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)667025668</subfield><subfield code="z">(OCoLC)427396657</subfield><subfield code="z">(OCoLC)648345825</subfield><subfield code="z">(OCoLC)772525451</subfield><subfield code="z">(OCoLC)817967209</subfield><subfield code="z">(OCoLC)963328274</subfield><subfield code="z">(OCoLC)1030121492</subfield><subfield code="z">(OCoLC)1030140618</subfield><subfield code="z">(OCoLC)1081060995</subfield><subfield code="z">(OCoLC)1089410839</subfield><subfield code="z">(OCoLC)1117488805</subfield><subfield code="z">(OCoLC)1117876288</subfield><subfield code="z">(OCoLC)1125933520</subfield><subfield code="z">(OCoLC)1144256988</subfield><subfield code="z">(OCoLC)1151155924</subfield><subfield code="z">(OCoLC)1162226229</subfield><subfield code="z">(OCoLC)1167212588</subfield><subfield code="z">(OCoLC)1171436142</subfield><subfield code="z">(OCoLC)1187195026</subfield><subfield code="z">(OCoLC)1205227666</subfield><subfield code="z">(OCoLC)1205405970</subfield><subfield code="z">(OCoLC)1205469864</subfield><subfield code="z">(OCoLC)1229537894</subfield><subfield code="z">(OCoLC)1241924443</subfield><subfield code="z">(OCoLC)1243380379</subfield><subfield code="z">(OCoLC)1246232404</subfield><subfield code="z">(OCoLC)1262566886</subfield><subfield code="z">(OCoLC)1264790804</subfield><subfield code="z">(OCoLC)1266783528</subfield><subfield code="z">(OCoLC)1269063642</subfield><subfield code="z">(OCoLC)1274015991</subfield><subfield code="z">(OCoLC)1292400180</subfield><subfield code="z">(OCoLC)1296539717</subfield><subfield code="z">(OCoLC)1300679763</subfield><subfield code="z">(OCoLC)1303358044</subfield><subfield code="z">(OCoLC)1303520756</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">238992</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.59</subfield><subfield code="b">.B66 2007</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3/52</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Boolos, George.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n88137851</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">5th ed. /</subfield><subfield code="b">George S. Boolos, John P. Burgess, Richard C. Jeffrey.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2007.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 350 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (page 341) and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Enumerability -- Diagonalization -- Turing Computability -- Uncomputability -- Abacus Computability -- Recursive Functions -- Recursive Sets and Relations -- Equivalent Definitions of Computability -- Precis of First-Order Logic: Syntax -- Precis of First-Order Logic: Semantics -- Undecidability of First-Order Logic -- Models -- Existence of Models -- Proofs and Completeness -- Arithmetization -- Representability of Recursive Functions -- Indefinability, Undecidability, Incompleteness -- Unprovability of Consistency -- Normal Forms -- Craig Interpolation Theorem -- Monadic and Dyadic Logic -- Second-Order Logic -- Arithmetical Definability -- Decidability of Arithmetic without Multiplication -- Nonstandard Models -- Ramsey's Theorem -- Modal Logic and Provability.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but also optional topics that include Turing's theory of computability and Ramsey's theorem.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computable functions.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85029469</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Recursive functions.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85112014</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Logic, Symbolic and mathematical.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85078115</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Fonctions calculables.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Fonctions récursives.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Logique symbolique et mathématique.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Machine Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computable functions</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logic, Symbolic and mathematical</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursive functions</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4138368-0</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematische Logik</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4037951-6</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Symbolisk logik.</subfield><subfield code="2">sao</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Burgess, John P.,</subfield><subfield code="d">1948-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJvHh7CbKpWMmDmWWMctrq</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2001013661</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jeffrey, Richard C.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n82093546</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Computability and logic (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGGTkBXmHwmqmB7Bqpbxfy</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Boolos, George.</subfield><subfield code="t">Computability and logic.</subfield><subfield code="b">5th ed.</subfield><subfield code="d">Cambridge ; New York : Cambridge University Press, 2007</subfield><subfield code="z">9780521877527</subfield><subfield code="w">(DLC) 2007014225</subfield><subfield code="w">(OCoLC)122526900</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=304603</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH37560536</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10213909</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">304603</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">238992</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">computabilitylog0000bool</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2764979</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7365433</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">9246830</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2812084</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn667025668 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:32Z |
| institution | BVB |
| isbn | 9780511649448 0511649444 9780511804076 0511804075 9780511366055 0511366051 9786612389924 6612389923 1107086507 9781107086500 1107183057 9781107183056 0511573979 9780511573972 051136668X 9780511366680 |
| language | English |
| oclc_num | 667025668 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xiii, 350 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Cambridge University Press, |
| record_format | marc |
| spelling | Boolos, George. http://id.loc.gov/authorities/names/n88137851 Computability and logic. 5th ed. / George S. Boolos, John P. Burgess, Richard C. Jeffrey. Cambridge ; New York : Cambridge University Press, 2007. 1 online resource (xiii, 350 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references (page 341) and index. Enumerability -- Diagonalization -- Turing Computability -- Uncomputability -- Abacus Computability -- Recursive Functions -- Recursive Sets and Relations -- Equivalent Definitions of Computability -- Precis of First-Order Logic: Syntax -- Precis of First-Order Logic: Semantics -- Undecidability of First-Order Logic -- Models -- Existence of Models -- Proofs and Completeness -- Arithmetization -- Representability of Recursive Functions -- Indefinability, Undecidability, Incompleteness -- Unprovability of Consistency -- Normal Forms -- Craig Interpolation Theorem -- Monadic and Dyadic Logic -- Second-Order Logic -- Arithmetical Definability -- Decidability of Arithmetic without Multiplication -- Nonstandard Models -- Ramsey's Theorem -- Modal Logic and Provability. This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but also optional topics that include Turing's theory of computability and Ramsey's theorem. English. Computable functions. http://id.loc.gov/authorities/subjects/sh85029469 Recursive functions. http://id.loc.gov/authorities/subjects/sh85112014 Logic, Symbolic and mathematical. http://id.loc.gov/authorities/subjects/sh85078115 Fonctions calculables. Fonctions récursives. Logique symbolique et mathématique. COMPUTERS Machine Theory. bisacsh Computable functions fast Logic, Symbolic and mathematical fast Recursive functions fast Berechenbarkeit gnd http://d-nb.info/gnd/4138368-0 Mathematische Logik gnd http://d-nb.info/gnd/4037951-6 Symbolisk logik. sao Burgess, John P., 1948- https://id.oclc.org/worldcat/entity/E39PBJvHh7CbKpWMmDmWWMctrq http://id.loc.gov/authorities/names/n2001013661 Jeffrey, Richard C. http://id.loc.gov/authorities/names/n82093546 has work: Computability and logic (Text) https://id.oclc.org/worldcat/entity/E39PCGGTkBXmHwmqmB7Bqpbxfy https://id.oclc.org/worldcat/ontology/hasWork Print version: Boolos, George. Computability and logic. 5th ed. Cambridge ; New York : Cambridge University Press, 2007 9780521877527 (DLC) 2007014225 (OCoLC)122526900 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=304603 Volltext |
| spellingShingle | Boolos, George Computability and logic. Enumerability -- Diagonalization -- Turing Computability -- Uncomputability -- Abacus Computability -- Recursive Functions -- Recursive Sets and Relations -- Equivalent Definitions of Computability -- Precis of First-Order Logic: Syntax -- Precis of First-Order Logic: Semantics -- Undecidability of First-Order Logic -- Models -- Existence of Models -- Proofs and Completeness -- Arithmetization -- Representability of Recursive Functions -- Indefinability, Undecidability, Incompleteness -- Unprovability of Consistency -- Normal Forms -- Craig Interpolation Theorem -- Monadic and Dyadic Logic -- Second-Order Logic -- Arithmetical Definability -- Decidability of Arithmetic without Multiplication -- Nonstandard Models -- Ramsey's Theorem -- Modal Logic and Provability. Computable functions. http://id.loc.gov/authorities/subjects/sh85029469 Recursive functions. http://id.loc.gov/authorities/subjects/sh85112014 Logic, Symbolic and mathematical. http://id.loc.gov/authorities/subjects/sh85078115 Fonctions calculables. Fonctions récursives. Logique symbolique et mathématique. COMPUTERS Machine Theory. bisacsh Computable functions fast Logic, Symbolic and mathematical fast Recursive functions fast Berechenbarkeit gnd http://d-nb.info/gnd/4138368-0 Mathematische Logik gnd http://d-nb.info/gnd/4037951-6 Symbolisk logik. sao |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85029469 http://id.loc.gov/authorities/subjects/sh85112014 http://id.loc.gov/authorities/subjects/sh85078115 http://d-nb.info/gnd/4138368-0 http://d-nb.info/gnd/4037951-6 |
| 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 | Computable functions. http://id.loc.gov/authorities/subjects/sh85029469 Recursive functions. http://id.loc.gov/authorities/subjects/sh85112014 Logic, Symbolic and mathematical. http://id.loc.gov/authorities/subjects/sh85078115 Fonctions calculables. Fonctions récursives. Logique symbolique et mathématique. COMPUTERS Machine Theory. bisacsh Computable functions fast Logic, Symbolic and mathematical fast Recursive functions fast Berechenbarkeit gnd http://d-nb.info/gnd/4138368-0 Mathematische Logik gnd http://d-nb.info/gnd/4037951-6 Symbolisk logik. sao |
| topic_facet | Computable functions. Recursive functions. Logic, Symbolic and mathematical. Fonctions calculables. Fonctions récursives. Logique symbolique et mathématique. COMPUTERS Machine Theory. Computable functions Logic, Symbolic and mathematical Recursive functions Berechenbarkeit Mathematische Logik Symbolisk logik. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=304603 |
| work_keys_str_mv | AT boolosgeorge computabilityandlogic AT burgessjohnp computabilityandlogic AT jeffreyrichardc computabilityandlogic |