Advertisement

Recursion Theory Week

Proceedings of a Conference held in Oberwolfach, West Germany April 15–21, 1984

  • Editors
  • Heinz-Dieter Ebbinghaus
  • Gert H. Müller
  • Gerald E. Sacks
Conference proceedings

Part of the Lecture Notes in Mathematics book series (LNM, volume 1141)

Table of contents

  1. Front Matter
    Pages I-IX
    PDF
  2. Generators of the recursively enumerable degrees
    Klaus Ambos-Spies
    Pages 1-28
  3. Kleene degrees of ultrafilters
    Andreas Blass
    Pages 29-48
  4. Recursion theory on strongly Σ2 inadmissible ordinals
    C. T. Chong
    Pages 49-64
  5. Applications of the low-basis theorem in arithmetic
    P. Clote
    Pages 65-88
  6. Strong reducibilities in α- and β-recursion theory
    Martin Dietzfelbinger, Wolfgang Maass
    Pages 89-120
  7. Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees
    Peter A. Fejer, Richard A. Shore
    Pages 121-140
  8. An immune partition of the ordinals
    Sy D. Friedman
    Pages 141-147
  9. An application of Π21-logic to descriptive set theory
    E. R. Griffor
    Pages 148-158
  10. Probabilistic machines, oracles, and quantifiers
    Peter G. Hinman, Stathis Zachos
    Pages 159-192
  11. Minimal polynomial degrees of nonrecursive sets
    Steven Homer
    Pages 193-202
  12. Genericity for recursively enumerable sets
    Carl G. Jockusch Jr.
    Pages 203-232
  13. Sets of everywhere singular functions
    Alexander S. Kechris
    Pages 233-244
  14. Measure, Π10-classes and complete extensions of PA
    Antonín Kučera
    Pages 245-259
  15. On the ordering of classes in high/low hierarchies
    Manuel Lerman
    Pages 260-270
  16. Generic objects in recursion theory
    A. Nerode, J. B. Remmel
    Pages 271-314
  17. The structure of m-degrees
    Piergiorgio Odifreddi
    Pages 315-332
  18. Some open questions in recursion theory
    Gerald E. Sacks
    Pages 333-342
  19. Absolute type 2 objects
    Juichi Shinoda
    Pages 343-356
  20. Recursion theoretic aspects of the dual ramsey theorem
    Stephen G. Simpson
    Pages 357-371
  21. Reflection and the priority method in E-recursion theory
    Theodore A. Slaman
    Pages 372-404
  22. Subrecursive ordinals
    S. S. Wainer
    Pages 405-418

About these proceedings

Keywords

Arithmetic computability theory function ordinal recursion set theory theorem turing degree

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0076211
  • Copyright Information Springer-Verlag Berlin Heidelberg 1985
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-15673-4
  • Online ISBN 978-3-540-39596-6
  • Series Print ISSN 0075-8434
  • Series Online ISSN 1617-9692
  • Buy this book on publisher's site