Verwandte Artikel zu Recursion Theory Week: Proceedings of a Conference...

Recursion Theory Week: Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984 (Lecture Notes in Mathematics, 1141, Band 1141) - Softcover

 
9783540156734: Recursion Theory Week: Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984 (Lecture Notes in Mathematics, 1141, Band 1141)

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorinnen und Autoren

Heinz-Dieter Ebbinghaus ist Professor im Ruhestand an der Abteilung für Mathematische Logik der Universität Freiburg.

Prof. Dr. H.-D. Ebbinghaus ist Leiter des Instituts für Mathematische Logik an der Universität Freiburg. Durch Veröffentlichungen hat der Autor einen hohen Bekanntheitsgrad in der Hochschulmathematik.

Von der hinteren Coverseite

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.