Recursion Theory Week
Proceedings of a Conference held in Oberwolfach, FRG, March 19-25, 1989
Published on 24. July 1990
Book
Paperback/Softback
VIII, 400 pages
978-3-540-52772-5 (ISBN)
Description
These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.
More details
Series
Edition
1990 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 400 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 23 mm
Weight
616 gr
ISBN-13
978-3-540-52772-5 (9783540527725)
DOI
10.1007/BFb0086109
Schweitzer Classification
Content
Honest polynomial reductions and exptally sets.- On the structure of degrees below O?.- Positive solutions to Post's problem.- The metamathematics of Fraïssé's order type conjecture.- Enumeration reducibility, nondeterministic computations and relative computability of partial functions.- Notes on the O? priority method with special attention to density results.- Array nonrecursive sets and multiple permitting arguments.- Superbranching degrees.- A direct construction of a minimal recursively enumerable truth-table degree.- ?2-induction and the construction of a high degree.- Undecidability and initial segments of the wtt-degrees ?0?.- Randomness and generalizations of fixed point free functions.- Recursive enumeration without repetition revisited.- Priority arguments using iterated trees of strategies.- On the relationship between the complexity, the degree, and the extension of a computable set.- Polynomially isolated sets.- A characterization of effective topological spaces.