Computability, enumerability, unsolvability: directions in recursion theory
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure m...
Saved in:
| Format: | Book |
|---|---|
| Language: | English |
| Published: |
Cambridge [u.a.]
Cambridge Univ. Press
1996
|
| Edition: | 1. publ. |
| Series: | London Mathematical Society: London Mathematical Society lecture note series
224 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Summary: | The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource. |
| Physical Description: | VII, 347 S. |
| ISBN: | 0521557364 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010653797 | ||
| 003 | DE-604 | ||
| 005 | 20090324 | ||
| 007 | t | ||
| 008 | 960313s1996 |||| 00||| eng d | ||
| 020 | |a 0521557364 |9 0-521-55736-4 | ||
| 035 | |a (OCoLC)33668032 | ||
| 035 | |a (DE-599)BVBBV010653797 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91G |a DE-384 |a DE-739 |a DE-29T |a DE-20 |a DE-703 |a DE-355 | ||
| 050 | 0 | |a QA9.6 | |
| 082 | 0 | |a 511.3/5 |2 20 | |
| 084 | |a SI 320 |0 (DE-625)143123: |2 rvk | ||
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a DAT 542f |2 stub | ||
| 245 | 1 | 0 | |a Computability, enumerability, unsolvability |b directions in recursion theory |c ed. by S. B. Cooper ... |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 1996 | |
| 300 | |a VII, 347 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a London Mathematical Society: London Mathematical Society lecture note series |v 224 | |
| 520 | 3 | |a The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource. | |
| 650 | 7 | |a Logica |2 gtt | |
| 650 | 7 | |a Recursie |2 gtt | |
| 650 | 4 | |a Recursivité, Théorie de la | |
| 650 | 7 | |a Récursivité, théorie de la |2 ram | |
| 650 | 4 | |a Logik | |
| 650 | 4 | |a Recursion theory | |
| 650 | 0 | 7 | |a Rekursionstheorie |0 (DE-588)4122329-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Rekursionstheorie |0 (DE-588)4122329-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Cooper, Stuart B. |d 1943-2015 |e Sonstige |0 (DE-588)133309096 |4 oth | |
| 830 | 0 | |a London Mathematical Society: London Mathematical Society lecture note series |v 224 |w (DE-604)BV000000130 |9 224 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007110681&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007110681 | ||
Record in the Search Index
| _version_ | 1804125131946065920 |
|---|---|
| adam_text | Contents
K. AMBOS SPIES
Resource bounded genericity. 1
M. M. ARSLANOV, S. LEMPP and R. A. SHORE
On isolating r.e. and isolated d r.e. degrees 61
S. B. COOPER
A characterisation of the jumps of minimal degrees below 0 81
R. DOWNEY, C. G. JOCKUSCH and M. STOB
Array nonrecursive degrees and genericity 93
L. HARRINGTON and R. I. SOARE
Dynamic properties of computably enumerable sets 105
A. J. HEATON and S. S. WAINER
Axioms for subrecursion theories 123
E. HERRMANN
On the V3 theory of the factor lattice by the major subset relation 139
M. KUMABE
Degrees of generic sets 167
M. LERMAN
Embeddings into the recursively enumerable degrees 185
M. E. MYTILINAIOS and T.A. SLAMAN
On a question of Brown and Simpson 205
A. NIES
Relativization of structures arising from computability theory 219
D. NORMANN
A Hierarchy of domains with totality, but without density 233
P. ODIFREDDI
Inductive inference of total functions 259
A. SORBI
The Medvedev lattice of degrees of difficulty. 289
X.YI
Extension ofembeddings on the recursively enumerable degrees modulo the cap
pable degrees 313
APPENDIX:
Questions in Recursion Theory 333
|
| any_adam_object | 1 |
| author_GND | (DE-588)133309096 |
| building | Verbundindex |
| bvnumber | BV010653797 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.6 |
| callnumber-search | QA9.6 |
| callnumber-sort | QA 19.6 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SI 320 SK 130 |
| classification_tum | DAT 542f |
| ctrlnum | (OCoLC)33668032 (DE-599)BVBBV010653797 |
| 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 | Informatik Mathematik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02566nam a2200493 cb4500</leader><controlfield tag="001">BV010653797</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090324 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960313s1996 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521557364</subfield><subfield code="9">0-521-55736-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33668032</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010653797</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</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-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 320</subfield><subfield code="0">(DE-625)143123:</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="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability, enumerability, unsolvability</subfield><subfield code="b">directions in recursion theory</subfield><subfield code="c">ed. by S. B. Cooper ...</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 347 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">London Mathematical Society: London Mathematical Society lecture note series</subfield><subfield code="v">224</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.</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">Recursie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursivité, Théorie de la</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Récursivité, théorie de la</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursion theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rekursionstheorie</subfield><subfield code="0">(DE-588)4122329-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rekursionstheorie</subfield><subfield code="0">(DE-588)4122329-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cooper, Stuart B.</subfield><subfield code="d">1943-2015</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)133309096</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">London Mathematical Society: London Mathematical Society lecture note series</subfield><subfield code="v">224</subfield><subfield code="w">(DE-604)BV000000130</subfield><subfield code="9">224</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007110681&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007110681</subfield></datafield></record></collection> |
| genre | (DE-588)4143413-4 Aufsatzsammlung gnd-content |
| genre_facet | Aufsatzsammlung |
| id | DE-604.BV010653797 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:56:41Z |
| institution | BVB |
| isbn | 0521557364 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007110681 |
| oclc_num | 33668032 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-384 DE-739 DE-29T DE-20 DE-703 DE-355 DE-BY-UBR |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-384 DE-739 DE-29T DE-20 DE-703 DE-355 DE-BY-UBR |
| physical | VII, 347 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| series | London Mathematical Society: London Mathematical Society lecture note series |
| series2 | London Mathematical Society: London Mathematical Society lecture note series |
| spelling | Computability, enumerability, unsolvability directions in recursion theory ed. by S. B. Cooper ... 1. publ. Cambridge [u.a.] Cambridge Univ. Press 1996 VII, 347 S. txt rdacontent n rdamedia nc rdacarrier London Mathematical Society: London Mathematical Society lecture note series 224 The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource. Logica gtt Recursie gtt Recursivité, Théorie de la Récursivité, théorie de la ram Logik Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd rswk-swf (DE-588)4143413-4 Aufsatzsammlung gnd-content Rekursionstheorie (DE-588)4122329-9 s DE-604 Cooper, Stuart B. 1943-2015 Sonstige (DE-588)133309096 oth London Mathematical Society: London Mathematical Society lecture note series 224 (DE-604)BV000000130 224 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007110681&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Computability, enumerability, unsolvability directions in recursion theory London Mathematical Society: London Mathematical Society lecture note series Logica gtt Recursie gtt Recursivité, Théorie de la Récursivité, théorie de la ram Logik Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
| subject_GND | (DE-588)4122329-9 (DE-588)4143413-4 |
| title | Computability, enumerability, unsolvability directions in recursion theory |
| title_auth | Computability, enumerability, unsolvability directions in recursion theory |
| title_exact_search | Computability, enumerability, unsolvability directions in recursion theory |
| title_full | Computability, enumerability, unsolvability directions in recursion theory ed. by S. B. Cooper ... |
| title_fullStr | Computability, enumerability, unsolvability directions in recursion theory ed. by S. B. Cooper ... |
| title_full_unstemmed | Computability, enumerability, unsolvability directions in recursion theory ed. by S. B. Cooper ... |
| title_short | Computability, enumerability, unsolvability |
| title_sort | computability enumerability unsolvability directions in recursion theory |
| title_sub | directions in recursion theory |
| topic | Logica gtt Recursie gtt Recursivité, Théorie de la Récursivité, théorie de la ram Logik Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
| topic_facet | Logica Recursie Recursivité, Théorie de la Récursivité, théorie de la Logik Recursion theory Rekursionstheorie Aufsatzsammlung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007110681&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000130 |
| work_keys_str_mv | AT cooperstuartb computabilityenumerabilityunsolvabilitydirectionsinrecursiontheory |