Recursion Theory Week [electronic resource] : Proceedings of a Conference held in Oberwolfach, West Germany April 15–21, 1984 / edited by Heinz-Dieter Ebbinghaus, Gert H. Müller, Gerald E. Sacks.

Contributor(s): Ebbinghaus, Heinz-Dieter [editor.] | Müller, Gert H [editor.] | Sacks, Gerald E [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Mathematics ; 1141Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1985Description: XII, 420 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540395966Subject(s): Mathematics | Logic, Symbolic and mathematical | Mathematics | Mathematical Logic and FoundationsAdditional physical formats: Printed edition:: No titleDDC classification: 511.3 LOC classification: QA8.9-10.3Online resources: Click here to access online
Contents:
Generators of the recursively enumerable degrees -- Kleene degrees of ultrafilters -- Recursion theory on strongly ?2 inadmissible ordinals -- Applications of the low-basis theorem in arithmetic -- Strong reducibilities in ?- and ?-recursion theory -- Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees -- An immune partition of the ordinals -- An application of ? 2 1 -logic to descriptive set theory -- Probabilistic machines, oracles, and quantifiers -- Minimal polynomial degrees of nonrecursive sets -- Genericity for recursively enumerable sets -- Sets of everywhere singular functions -- Measure, ? 1 0 -classes and complete extensions of PA -- On the ordering of classes in high/low hierarchies -- Generic objects in recursion theory -- The structure of m-degrees -- Some open questions in recursion theory -- Absolute type 2 objects -- Recursion theoretic aspects of the dual ramsey theorem -- Reflection and the priority method in E-recursion theory -- Subrecursive ordinals.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK1130

Generators of the recursively enumerable degrees -- Kleene degrees of ultrafilters -- Recursion theory on strongly ?2 inadmissible ordinals -- Applications of the low-basis theorem in arithmetic -- Strong reducibilities in ?- and ?-recursion theory -- Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees -- An immune partition of the ordinals -- An application of ? 2 1 -logic to descriptive set theory -- Probabilistic machines, oracles, and quantifiers -- Minimal polynomial degrees of nonrecursive sets -- Genericity for recursively enumerable sets -- Sets of everywhere singular functions -- Measure, ? 1 0 -classes and complete extensions of PA -- On the ordering of classes in high/low hierarchies -- Generic objects in recursion theory -- The structure of m-degrees -- Some open questions in recursion theory -- Absolute type 2 objects -- Recursion theoretic aspects of the dual ramsey theorem -- Reflection and the priority method in E-recursion theory -- Subrecursive ordinals.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha