Buchumschlag

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Weitere Verfasser: Cooper, Stuart B. (HerausgeberIn) , Slaman, T. (HerausgeberIn) , Wainer, S. (HerausgeberIn)
Dokumenttyp: Sammelband
Sprache:Englisch
Veröffentlicht: Cambridge Cambridge University Press 1996.
Schriftenreihe:London Mathematical Society lecture note series 224
In: London Mathematical Society lecture note series (224)

Volumes / Articles: Show Volumes / Articles.
DOI:10.1017/CBO9780511629167
Schlagworte:
Aufsatzsammlung
Rekursionstheorie
Online-Zugang:Verlag, Volltext: https://doi.org/10.1017/CBO9780511629167
Verlag, Zentralblatt MATH, Inhaltstext: https://zbmath.org/?q=an:0830.00006
Volltext
Verfasserangaben:edited by S.B. Cooper, T.A. Slaman, S.S. Wainer

MARC

LEADER 00000cam a2200000 c 4500
001 883351358
003 DE-627
005 20251204174811.0
007 cr uuu---uuuuu
008 170425r19961996xxk|||||o 00| ||eng c
020 |a 9780511629167  |c  : ebook  |9 978-0-511-62916-7 
024 7 |a 10.1017/CBO9780511629167  |2 doi 
035 |a (DE-627)883351358 
035 |a (DE-576)486903834 
035 |a (DE-599)GBV883351358 
035 |a (OCoLC)849895410 
035 |a (OCoLC)849895410 
035 |a (ZBM)0830.00006 
035 |a (CUP)CR9780511629167 
035 |a (DE-627-1)051463466 
040 |a DE-627  |b ger  |c DE-627  |e rda 
041 |a eng 
044 |c XA-GB 
050 0 |a QA9.6 
082 0 |a 511.3/5 
084 |a 28  |2 sdnb 
084 |a 27  |2 sdnb 
084 |a SI 320  |2 rvk  |0 (DE-625)rvk/143123: 
084 |a SK 130  |2 rvk  |0 (DE-625)rvk/143216: 
084 |a *00B15  |2 msc 
084 |a 03-06  |2 msc 
084 |a 31.10  |2 bkl 
245 0 0 |a Computability, enumerability, unsolvability  |b directions in recursion theory  |c edited by S.B. Cooper, T.A. Slaman, S.S. Wainer 
264 1 |a Cambridge  |b Cambridge University Press  |c 1996. 
300 |a 1 Online-Ressource (vii, 347 pages)  |b digital, PDF file(s). 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
490 1 |a London Mathematical Society lecture note series  |v 224 
500 |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) 
520 |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. 
520 |a Resource bounded genericity / K. Ambos-Spies -- On isolating r.e. and isolated d-r.e. degrees / M.M. Arslanov, S. Lempp and R.A. Shore -- A characterisation of the jumps of minimal degrees below 0' / S.B. Cooper -- Array nonrecursive degrees and genericity / R. Downey, C.G. Jockusch and M. Stob -- Dynamic properties of computably enumerable sets / L. Harrington and R.I. Soare -- Axioms for subrecursion theories / A.J. Heaton and S.S. Wainer -- On the [actual symbol not reproducible] -- theory of the factor lattice by the major subset relation / E. Herrmann -- Degrees of generic sets / M. Kumabe -- Embeddings into the recursively enumerable degrees / M. Lerman -- On a question of Brown and Simpson / M.E. Mytilinaios and T.A. Slaman -- Relativization of structures arising from computability theory / A. Nies -- A Hierarchy of domains with totality, but without density / D. Normann -- Inductive inference of total functions / P. Odifreddi 
534 |c 1996 
650 0 |a Recursion theory 
650 4 |a Mathematics 
655 7 |a Aufsatzsammlung  |0 (DE-588)4143413-4  |0 (DE-627)105605727  |0 (DE-576)209726091  |2 gnd-content 
689 0 0 |d s  |0 (DE-588)4122329-9  |0 (DE-627)105763241  |0 (DE-576)20955049X  |a Rekursionstheorie  |2 gnd 
689 0 |5 (DE-627) 
700 1 |a Cooper, Stuart B.  |d 1943-2015  |e HerausgeberIn  |0 (DE-588)133309096  |0 (DE-627)540517380  |0 (DE-576)174860250  |4 edt 
700 1 |a Slaman, T.  |e HerausgeberIn  |4 edt 
700 1 |a Wainer, S.  |e HerausgeberIn  |4 edt 
776 1 |z 9780521557368  |c paperback 
776 1 |z 9780521557368 
776 1 |z 9780521557368  |c  : paperback 
776 0 8 |i Erscheint auch als  |n Druck-Ausgabe  |t Computability, enumerability, unsolvability  |d Cambridge [u.a.] : Cambridge Univ. Press, 1996  |h VII, 347 S  |w (DE-627)271800372  |w (DE-576)049859471  |z 0521557364 
830 0 |a London Mathematical Society lecture note series  |v 224  |9 224  |w (DE-627)89721840X  |w (DE-576)493242023  |w (DE-600)2904882-5  |7 am 
856 4 0 |u https://doi.org/10.1017/CBO9780511629167  |m X:CUP  |x Verlag  |3 Volltext 
856 4 2 |u https://zbmath.org/?q=an:0830.00006  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
912 |a ZDB-20-CTM 
912 |a ZDB-20-CBO 
935 |i Blocktest 
936 r v |a SI 320  |b London Mathematical Society: Lecture notes series  |k Mathematik  |k Schriftenreihen  |k Schriftenreihen in der Ordnung der Bandzählung  |k London Mathematical Society: Lecture notes series  |0 (DE-627)1271545187  |0 (DE-625)rvk/143123:  |0 (DE-576)201545187 
936 r v |a SK 130  |b Logik und Grundlagen, Metamathematik,  |k Mathematik  |k Monografien  |k Logik und Grundlagen, Metamathematik,  |0 (DE-627)1270918567  |0 (DE-625)rvk/143216:  |0 (DE-576)200918567 
936 b k |a 31.10  |j Mathematische Logik  |j Mengenlehre  |q SEPA  |0 (DE-627)10640847X 
951 |a BO 
990 |a Rekursionstheorie 
992 |a 20230419 
999 |a KXP-PPN883351358  |e 4311109601 
BIB |a Y 
SPR |a Y 
JSO |a {"language":["eng"],"recId":"883351358","physDesc":[{"noteIll":"digital, PDF file(s).","extent":"1 Online-Ressource (vii, 347 pages)"}],"note":["Title from publisher's bibliographic system (viewed on 05 Oct 2015)"],"type":{"bibl":"edited-book","media":"Online-Ressource"},"relMultPart":[{"part":{"number_sort":["224"],"number":["224"]},"pubHistory":["269 [?]-"],"recId":"89721840X","corporate":[{"roleDisplay":"Herausgebendes Organ","display":"London Mathematical Society","role":"isb"}],"language":["eng"],"note":["Gesehen am 6. September 2017"],"type":{"media":"Online-Ressource","bibl":"serial"},"disp":"London Mathematical Society lecture note series","title":[{"title":"London Mathematical Society lecture note series","title_sort":"London Mathematical Society lecture note series"}],"dispAlt":"London Mathematical Society lecture note series","physDesc":[{"extent":"Online-Ressource"}],"id":{"eki":["89721840X"],"zdb":["2904882-5"]},"origin":[{"publisherPlace":"Cambridge ; New York ; Melbourne ; Madrid ; Capetown ; Singapore ; Sao Paulo ; Delhi ; Mexico City","publisher":"Cambridge University Press","dateIssuedDisp":"[2000?]-"}]}],"name":{"displayForm":["edited by S.B. Cooper, T.A. Slaman, S.S. Wainer"]},"person":[{"given":"Stuart B.","family":"Cooper","role":"edt","roleDisplay":"HerausgeberIn","display":"Cooper, Stuart B."},{"given":"T.","family":"Slaman","role":"edt","display":"Slaman, T.","roleDisplay":"HerausgeberIn"},{"family":"Wainer","given":"S.","roleDisplay":"HerausgeberIn","display":"Wainer, S.","role":"edt"}],"id":{"isbn":["9780511629167"],"eki":["883351358"],"doi":["10.1017/CBO9780511629167"]},"origin":[{"publisherPlace":"Cambridge","publisher":"Cambridge University Press","dateIssuedKey":"1996","dateIssuedDisp":"1996."}],"title":[{"subtitle":"directions in recursion theory","title":"Computability, enumerability, unsolvability","title_sort":"Computability, enumerability, unsolvability"}]} 
SRT |a COMPUTABIL1996 

Ähnliche Einträge