Recursion theory /:
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the 1st publication in the Lecture Not...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge :
Cambridge University Press,
[2016]
|
| Schriftenreihe: | Lecture notes in logic ;
1. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the 1st publication in the Lecture Notes in Logic series, Shoenfield gives a clear and focused introduction to recursion theory. The fundamental concept of recursion one of the pillars on which modern computer science rests. This introduction is an ideal instrument for teaching and self-study that prepares the reader for the study of advanced monographs and the current literature on recursion theory. |
| Beschreibung: | 1 online resource (84 pages) |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781107168084 1107168082 9781316717011 1316717011 |
Internformat
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn982187154 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr mn||||||||| | ||
| 008 | 170412t20162016enk ob 001 0 eng d | ||
| 040 | |a LGG |b eng |e rda |e pn |c LGG |d OCLCO |d EBLCP |d IDEBK |d N$T |d NOC |d YDX |d UIU |d OCLCF |d OSU |d OCLCQ |d U3W |d COO |d UKAHL |d CLU |d OCLCQ |d OCLCO |d OCLCQ |d K6U |d OCLCO |d N$T |d OCL |d OCLCQ |d OCLCO |d S9M |d OCLCL |d OCLCQ | ||
| 019 | |a 982240734 |a 982280133 |a 982330515 |a 982399288 |a 982424525 |a 982515741 |a 982538989 |a 982591231 |a 982740297 |a 982853591 | ||
| 020 | |a 9781107168084 | ||
| 020 | |a 1107168082 | ||
| 020 | |a 9781316717011 |q (electronic bk.) | ||
| 020 | |a 1316717011 |q (electronic bk.) | ||
| 020 | |z 9781107168084 |q (hardback) | ||
| 020 | |z 1107168082 |q (hardback) | ||
| 020 | |z 9781316754771 | ||
| 020 | |z 1316754774 | ||
| 020 | |z 9781316748985 | ||
| 020 | |z 1316748987 | ||
| 035 | |a (OCoLC)982187154 |z (OCoLC)982240734 |z (OCoLC)982280133 |z (OCoLC)982330515 |z (OCoLC)982399288 |z (OCoLC)982424525 |z (OCoLC)982515741 |z (OCoLC)982538989 |z (OCoLC)982591231 |z (OCoLC)982740297 |z (OCoLC)982853591 | ||
| 050 | 4 | |a QA9.6 | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 7 | |a 511.3/5 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Shoenfield, Joseph R. |q (Joseph Robert), |d 1927- |e author. |1 https://id.oclc.org/worldcat/entity/E39PBJxmGq3Fm36MJdCtbf8grq |0 http://id.loc.gov/authorities/names/n84803518 | |
| 245 | 1 | 0 | |a Recursion theory / |c Joseph R. Shoenfield, Duke University, North Carolina. |
| 264 | 1 | |a Cambridge : |b Cambridge University Press, |c [2016] | |
| 264 | 4 | |c ©2016 | |
| 300 | |a 1 online resource (84 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in logic ; |v 1 | |
| 520 | |a Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the 1st publication in the Lecture Notes in Logic series, Shoenfield gives a clear and focused introduction to recursion theory. The fundamental concept of recursion one of the pillars on which modern computer science rests. This introduction is an ideal instrument for teaching and self-study that prepares the reader for the study of advanced monographs and the current literature on recursion theory. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a Functions and relations -- The basic machine -- Macros -- Closure properties -- Definitions of recursive functions -- Codes -- Indices -- Church's thesis -- Word problems -- Undecidable theories -- Relative recursion -- The arithmetical hierarchy -- Recursively enumerable relations -- Degrees -- Evaluation of degrees -- Large RE sets -- Function of reals -- The analytical hierarchy -- The projective hierarchy. | |
| 588 | 0 | |a Print version record. | |
| 650 | 0 | |a Recursion theory. |0 http://id.loc.gov/authorities/subjects/sh85112012 | |
| 650 | 0 | |a Computer science. |0 http://id.loc.gov/authorities/subjects/sh89003285 | |
| 650 | 0 | |a Mathematics. |0 http://id.loc.gov/authorities/subjects/sh85082139 | |
| 650 | 0 | |a Logic. |0 http://id.loc.gov/authorities/subjects/sh85078106 | |
| 650 | 0 | |a Electronic data processing. |0 http://id.loc.gov/authorities/subjects/sh85042288 | |
| 650 | 6 | |a Théorie de la récursivité. | |
| 650 | 6 | |a Informatique. | |
| 650 | 6 | |a Mathématiques. | |
| 650 | 7 | |a computer science. |2 aat | |
| 650 | 7 | |a data processing. |2 aat | |
| 650 | 7 | |a applied mathematics. |2 aat | |
| 650 | 7 | |a mathematics. |2 aat | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Proceso de datos |2 embne | |
| 650 | 7 | |a Electronic data processing |2 fast | |
| 650 | 7 | |a Computer science |2 fast | |
| 650 | 7 | |a Logic |2 fast | |
| 650 | 7 | |a Mathematics |2 fast | |
| 650 | 7 | |a Recursion theory |2 fast | |
| 776 | 0 | 8 | |i Electronic reproduction of (manifestation): |a SHOENFIELD, JOSEPH R. |t RECURSION THEORY. |d [Place of publication not identified] : CAMBRIDGE UNIV Press, 2016 |z 1107168082 |w (OCoLC)959527607 |
| 830 | 0 | |a Lecture notes in logic ; |v 1. |0 http://id.loc.gov/authorities/names/n93082404 | |
| 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=1475798 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH34211155 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH32658266 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH32588633 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL4812302 | ||
| 938 | |a EBSCOhost |b EBSC |n 1475798 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis38009340 | ||
| 938 | |a YBP Library Services |b YANK |n 14008055 | ||
| 938 | |a YBP Library Services |b YANK |n 14007743 | ||
| 938 | |a YBP Library Services |b YANK |n 13972498 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn982187154 |
|---|---|
| _version_ | 1816882385701044224 |
| adam_text | |
| any_adam_object | |
| author | Shoenfield, Joseph R. (Joseph Robert), 1927- |
| author_GND | http://id.loc.gov/authorities/names/n84803518 |
| author_facet | Shoenfield, Joseph R. (Joseph Robert), 1927- |
| author_role | aut |
| author_sort | Shoenfield, Joseph R. 1927- |
| author_variant | j r s jr jrs |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.6 |
| callnumber-search | QA9.6 |
| callnumber-sort | QA 19.6 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Functions and relations -- The basic machine -- Macros -- Closure properties -- Definitions of recursive functions -- Codes -- Indices -- Church's thesis -- Word problems -- Undecidable theories -- Relative recursion -- The arithmetical hierarchy -- Recursively enumerable relations -- Degrees -- Evaluation of degrees -- Large RE sets -- Function of reals -- The analytical hierarchy -- The projective hierarchy. |
| ctrlnum | (OCoLC)982187154 |
| dewey-full | 511.3/5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/5 |
| dewey-search | 511.3/5 |
| dewey-sort | 3511.3 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04899cam a2200841 i 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn982187154</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mn|||||||||</controlfield><controlfield tag="008">170412t20162016enk ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">LGG</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">LGG</subfield><subfield code="d">OCLCO</subfield><subfield code="d">EBLCP</subfield><subfield code="d">IDEBK</subfield><subfield code="d">N$T</subfield><subfield code="d">NOC</subfield><subfield code="d">YDX</subfield><subfield code="d">UIU</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OSU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">COO</subfield><subfield code="d">UKAHL</subfield><subfield code="d">CLU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCO</subfield><subfield code="d">N$T</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">S9M</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">982240734</subfield><subfield code="a">982280133</subfield><subfield code="a">982330515</subfield><subfield code="a">982399288</subfield><subfield code="a">982424525</subfield><subfield code="a">982515741</subfield><subfield code="a">982538989</subfield><subfield code="a">982591231</subfield><subfield code="a">982740297</subfield><subfield code="a">982853591</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107168084</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107168082</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781316717011</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1316717011</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781107168084</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1107168082</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781316754771</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1316754774</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781316748985</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1316748987</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)982187154</subfield><subfield code="z">(OCoLC)982240734</subfield><subfield code="z">(OCoLC)982280133</subfield><subfield code="z">(OCoLC)982330515</subfield><subfield code="z">(OCoLC)982399288</subfield><subfield code="z">(OCoLC)982424525</subfield><subfield code="z">(OCoLC)982515741</subfield><subfield code="z">(OCoLC)982538989</subfield><subfield code="z">(OCoLC)982591231</subfield><subfield code="z">(OCoLC)982740297</subfield><subfield code="z">(OCoLC)982853591</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.6</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3/5</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Shoenfield, Joseph R.</subfield><subfield code="q">(Joseph Robert),</subfield><subfield code="d">1927-</subfield><subfield code="e">author.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJxmGq3Fm36MJdCtbf8grq</subfield><subfield code="0">http://id.loc.gov/authorities/names/n84803518</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recursion theory /</subfield><subfield code="c">Joseph R. Shoenfield, Duke University, North Carolina.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (84 pages)</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="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in logic ;</subfield><subfield code="v">1</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the 1st publication in the Lecture Notes in Logic series, Shoenfield gives a clear and focused introduction to recursion theory. The fundamental concept of recursion one of the pillars on which modern computer science rests. This introduction is an ideal instrument for teaching and self-study that prepares the reader for the study of advanced monographs and the current literature on recursion theory.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Functions and relations -- The basic machine -- Macros -- Closure properties -- Definitions of recursive functions -- Codes -- Indices -- Church's thesis -- Word problems -- Undecidable theories -- Relative recursion -- The arithmetical hierarchy -- Recursively enumerable relations -- Degrees -- Evaluation of degrees -- Large RE sets -- Function of reals -- The analytical hierarchy -- The projective hierarchy.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Recursion theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85112012</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer science.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh89003285</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematics.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85082139</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Logic.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85078106</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Electronic data processing.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85042288</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie de la récursivité.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Informatique.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">computer science.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">data processing.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">applied mathematics.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">mathematics.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Proceso de datos</subfield><subfield code="2">embne</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electronic data processing</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer science</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logic</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Recursion theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Electronic reproduction of (manifestation):</subfield><subfield code="a">SHOENFIELD, JOSEPH R.</subfield><subfield code="t">RECURSION THEORY.</subfield><subfield code="d">[Place of publication not identified] : CAMBRIDGE UNIV Press, 2016</subfield><subfield code="z">1107168082</subfield><subfield code="w">(OCoLC)959527607</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in logic ;</subfield><subfield code="v">1.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n93082404</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=1475798</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">AH34211155</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH32658266</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH32588633</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL4812302</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">1475798</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis38009340</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">14008055</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">14007743</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">13972498</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-ocn982187154 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:27:47Z |
| institution | BVB |
| isbn | 9781107168084 1107168082 9781316717011 1316717011 |
| language | English |
| oclc_num | 982187154 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (84 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | Lecture notes in logic ; |
| series2 | Lecture notes in logic ; |
| spelling | Shoenfield, Joseph R. (Joseph Robert), 1927- author. https://id.oclc.org/worldcat/entity/E39PBJxmGq3Fm36MJdCtbf8grq http://id.loc.gov/authorities/names/n84803518 Recursion theory / Joseph R. Shoenfield, Duke University, North Carolina. Cambridge : Cambridge University Press, [2016] ©2016 1 online resource (84 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Lecture notes in logic ; 1 Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the 1st publication in the Lecture Notes in Logic series, Shoenfield gives a clear and focused introduction to recursion theory. The fundamental concept of recursion one of the pillars on which modern computer science rests. This introduction is an ideal instrument for teaching and self-study that prepares the reader for the study of advanced monographs and the current literature on recursion theory. Includes bibliographical references and index. Functions and relations -- The basic machine -- Macros -- Closure properties -- Definitions of recursive functions -- Codes -- Indices -- Church's thesis -- Word problems -- Undecidable theories -- Relative recursion -- The arithmetical hierarchy -- Recursively enumerable relations -- Degrees -- Evaluation of degrees -- Large RE sets -- Function of reals -- The analytical hierarchy -- The projective hierarchy. Print version record. Recursion theory. http://id.loc.gov/authorities/subjects/sh85112012 Computer science. http://id.loc.gov/authorities/subjects/sh89003285 Mathematics. http://id.loc.gov/authorities/subjects/sh85082139 Logic. http://id.loc.gov/authorities/subjects/sh85078106 Electronic data processing. http://id.loc.gov/authorities/subjects/sh85042288 Théorie de la récursivité. Informatique. Mathématiques. computer science. aat data processing. aat applied mathematics. aat mathematics. aat MATHEMATICS General. bisacsh Proceso de datos embne Electronic data processing fast Computer science fast Logic fast Mathematics fast Recursion theory fast Electronic reproduction of (manifestation): SHOENFIELD, JOSEPH R. RECURSION THEORY. [Place of publication not identified] : CAMBRIDGE UNIV Press, 2016 1107168082 (OCoLC)959527607 Lecture notes in logic ; 1. http://id.loc.gov/authorities/names/n93082404 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1475798 Volltext |
| spellingShingle | Shoenfield, Joseph R. (Joseph Robert), 1927- Recursion theory / Lecture notes in logic ; Functions and relations -- The basic machine -- Macros -- Closure properties -- Definitions of recursive functions -- Codes -- Indices -- Church's thesis -- Word problems -- Undecidable theories -- Relative recursion -- The arithmetical hierarchy -- Recursively enumerable relations -- Degrees -- Evaluation of degrees -- Large RE sets -- Function of reals -- The analytical hierarchy -- The projective hierarchy. Recursion theory. http://id.loc.gov/authorities/subjects/sh85112012 Computer science. http://id.loc.gov/authorities/subjects/sh89003285 Mathematics. http://id.loc.gov/authorities/subjects/sh85082139 Logic. http://id.loc.gov/authorities/subjects/sh85078106 Electronic data processing. http://id.loc.gov/authorities/subjects/sh85042288 Théorie de la récursivité. Informatique. Mathématiques. computer science. aat data processing. aat applied mathematics. aat mathematics. aat MATHEMATICS General. bisacsh Proceso de datos embne Electronic data processing fast Computer science fast Logic fast Mathematics fast Recursion theory fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85112012 http://id.loc.gov/authorities/subjects/sh89003285 http://id.loc.gov/authorities/subjects/sh85082139 http://id.loc.gov/authorities/subjects/sh85078106 http://id.loc.gov/authorities/subjects/sh85042288 |
| title | Recursion theory / |
| title_auth | Recursion theory / |
| title_exact_search | Recursion theory / |
| title_full | Recursion theory / Joseph R. Shoenfield, Duke University, North Carolina. |
| title_fullStr | Recursion theory / Joseph R. Shoenfield, Duke University, North Carolina. |
| title_full_unstemmed | Recursion theory / Joseph R. Shoenfield, Duke University, North Carolina. |
| title_short | Recursion theory / |
| title_sort | recursion theory |
| topic | Recursion theory. http://id.loc.gov/authorities/subjects/sh85112012 Computer science. http://id.loc.gov/authorities/subjects/sh89003285 Mathematics. http://id.loc.gov/authorities/subjects/sh85082139 Logic. http://id.loc.gov/authorities/subjects/sh85078106 Electronic data processing. http://id.loc.gov/authorities/subjects/sh85042288 Théorie de la récursivité. Informatique. Mathématiques. computer science. aat data processing. aat applied mathematics. aat mathematics. aat MATHEMATICS General. bisacsh Proceso de datos embne Electronic data processing fast Computer science fast Logic fast Mathematics fast Recursion theory fast |
| topic_facet | Recursion theory. Computer science. Mathematics. Logic. Electronic data processing. Théorie de la récursivité. Informatique. Mathématiques. computer science. data processing. applied mathematics. mathematics. MATHEMATICS General. Proceso de datos Electronic data processing Computer science Logic Mathematics Recursion theory |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1475798 |
| work_keys_str_mv | AT shoenfieldjosephr recursiontheory |