Higher recursion theory:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
1990
|
Schriftenreihe: | Perspectives in mathematical logic
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XV, 344 S. |
ISBN: | 3540193057 0387193057 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV001801488 | ||
003 | DE-604 | ||
005 | 20081024 | ||
007 | t | ||
008 | 890131s1990 |||| 00||| eng d | ||
020 | |a 3540193057 |9 3-540-19305-7 | ||
020 | |a 0387193057 |9 0-387-19305-7 | ||
035 | |a (OCoLC)19130395 | ||
035 | |a (DE-599)BVBBV001801488 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91 |a DE-12 |a DE-703 |a DE-739 |a DE-824 |a DE-29T |a DE-19 |a DE-706 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
050 | 0 | |a QA9.6 | |
082 | 0 | |a 511.3 |2 19 | |
084 | |a CC 2600 |0 (DE-625)17610: |2 rvk | ||
084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
084 | |a DAT 542f |2 stub | ||
084 | |a MAT 034f |2 stub | ||
084 | |a 03D65 |2 msc | ||
100 | 1 | |a Sacks, Gerald E. |d 1933-2019 |e Verfasser |0 (DE-588)128780770 |4 aut | |
245 | 1 | 0 | |a Higher recursion theory |c Gerald E. Sacks |
264 | 1 | |a Berlin [u.a.] |b Springer |c 1990 | |
300 | |a XV, 344 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Perspectives in mathematical logic | |
650 | 7 | |a Récursivité, théorie de la |2 ram | |
650 | 4 | |a Recursion theory | |
650 | 0 | 7 | |a Rekursionstheorie |0 (DE-588)4122329-9 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Rekursionstheorie |0 (DE-588)4122329-9 |D s |
689 | 0 | |5 DE-604 | |
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=001210673&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-001210673 |
Datensatz im Suchindex
_version_ | 1804116290932047872 |
---|---|
adam_text | Contents
Part A. Hyperarithmetic Sets 1
Chapter I. Constructive Ordinals and nj Sets 3
1. Analytical Predicates 3
2. Notations for Ordinals 8
3. Effective Transfinite Recursion 10
4. Recursive Ordinals 15
5. Ordinal Analysis of nj Sets 18
Chapter II. The Hyperarithmetic Hierarchy 22
1. Hyperarithmetic Implies A} 22
2. A} Implies Hyperarithmetic 28
3. Selection and Reduction 32
4. IT5 Singletons 37
5. Hyperarithmetic Reducibility 42
6. Incomparable Hyperdegrees Via Measure 46
7. The Hyperjump 48
Chapter III. S { Predicates of Reals 52
1. Basis Theorems 52
2. Unique Notations for Ordinals 55
3. Hyperarithmetic Quantifiers 59
4. The Ramified Analytic Hierarchy 62
5. Kreisel Compactness 70
6. Perfect Subsets of Z} Sets 71
7. Kreisel s Basis Theorem 74
8. Inductive Definitions 76
9. nj Singletons 81
XIV Contents
Chapter IV Measure and Forcing 88
1. Measure Theoretic Uniformity 88
2. Measure Theoretic Basis Theorems 92
3. Cohen Forcing 94
4. Perfect Forcing 98
5. Minimal Hyperdegrees 103
6. Louveau Separation 107
Part B. Metarecursion 113
Chapter V Metarecursive Enumerability ....115
1. Fundamentals of Metarecursion ...115
2. Metafmite Computations 121
3. Relative Metarecursiveness 124
4. Regularity 129
Chapter VI. Hyperregularity and Priority 135
1. Hyperregular Sets 135
2. Two Priority Arguments 138
3. Simpson s Dichotomy 146
Part C. a Recursion .149
Chapter VII. Admissibility and Regularity ....151
1. Zx Admissibility ....151
2. TheX^ Projectum 157
3. Relative a Recursiveness 161
4. Existence of Regular Sets 165
5. Hyperregularity 167
Chapter VIII. Priority Arguments 175
1. a Finite Injury via a* 175
2. a Finite Injury and Tameness 178
3. Dynamic Versus Fine Structure 184
4. S , Doing the Work of S2 194
Contents XV
Chapter IX. Splitting, Density and Beyond 204
1. Shore s Splitting Theorem 204
2. Further Fine Structure 207
3. Density for a 212
4. Preliminaries to a Density 216
5. Shore s Density Theorem 218
6. /ï Recursion Theory 227
PartD. ^ Recursion 231
Chapter X. £ Closed Structures 233
1. Partial ^ Recursive Functions 233
2. Computations 237
3. Reflection 242
4. Gandy Selection 244
5. Moschovakis Witnesses 249
Chapter XL Forcing Computations to Converge 259
1. Set Forcing over L (k) 259
2. Countably Closed Forcing 265
3. Enumerable Forcing Relations 270
4. Countable Chain Condition Forcing 273
5. Normann Selection and Singular Cardinals 279
6. Further Forcing 281
Chapter XII. Selection and /c Sections 283
1. Grilliot Selection 284
2. Moschovakis Selection 287
3. Plus One Theorems 290
4. Harrington s Plus Two Theorem 299
5. Selection with Additional Predicates 304
Chapter XIII. ^ Recursively Enumerable Degrees 309
1. Regular Sets 309
2. Projecta and Cofinalities 313
3. van de Wiele s Theorem 325
4. Post s Problem for ^ Recursion 328
5. Slaman s Splitting and Density Theorems 333
Bibliography 339
Subject Index 343
|
any_adam_object | 1 |
author | Sacks, Gerald E. 1933-2019 |
author_GND | (DE-588)128780770 |
author_facet | Sacks, Gerald E. 1933-2019 |
author_role | aut |
author_sort | Sacks, Gerald E. 1933-2019 |
author_variant | g e s ge ges |
building | Verbundindex |
bvnumber | BV001801488 |
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 | CC 2600 SK 130 |
classification_tum | DAT 542f MAT 034f |
ctrlnum | (OCoLC)19130395 (DE-599)BVBBV001801488 |
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 | Informatik Mathematik Philosophie |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01589nam a2200433 c 4500</leader><controlfield tag="001">BV001801488</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20081024 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890131s1990 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540193057</subfield><subfield code="9">3-540-19305-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387193057</subfield><subfield code="9">0-387-19305-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19130395</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV001801488</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-91</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</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</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">CC 2600</subfield><subfield code="0">(DE-625)17610:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 034f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">03D65</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sacks, Gerald E.</subfield><subfield code="d">1933-2019</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128780770</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Higher recursion theory</subfield><subfield code="c">Gerald E. Sacks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 344 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="0" ind2=" "><subfield code="a">Perspectives in mathematical logic</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">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="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="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=001210673&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-001210673</subfield></datafield></record></collection> |
id | DE-604.BV001801488 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T15:36:10Z |
institution | BVB |
isbn | 3540193057 0387193057 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001210673 |
oclc_num | 19130395 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM DE-12 DE-703 DE-739 DE-824 DE-29T DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-188 |
owner_facet | DE-91 DE-BY-TUM DE-12 DE-703 DE-739 DE-824 DE-29T DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-188 |
physical | XV, 344 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
publisher | Springer |
record_format | marc |
series2 | Perspectives in mathematical logic |
spelling | Sacks, Gerald E. 1933-2019 Verfasser (DE-588)128780770 aut Higher recursion theory Gerald E. Sacks Berlin [u.a.] Springer 1990 XV, 344 S. txt rdacontent n rdamedia nc rdacarrier Perspectives in mathematical logic Récursivité, théorie de la ram Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd rswk-swf Rekursionstheorie (DE-588)4122329-9 s DE-604 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001210673&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Sacks, Gerald E. 1933-2019 Higher recursion theory Récursivité, théorie de la ram Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
subject_GND | (DE-588)4122329-9 |
title | Higher recursion theory |
title_auth | Higher recursion theory |
title_exact_search | Higher recursion theory |
title_full | Higher recursion theory Gerald E. Sacks |
title_fullStr | Higher recursion theory Gerald E. Sacks |
title_full_unstemmed | Higher recursion theory Gerald E. Sacks |
title_short | Higher recursion theory |
title_sort | higher recursion theory |
topic | Récursivité, théorie de la ram Recursion theory Rekursionstheorie (DE-588)4122329-9 gnd |
topic_facet | Récursivité, théorie de la Recursion theory Rekursionstheorie |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001210673&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT sacksgeralde higherrecursiontheory |