The Combinatorics of the Friedberg-Muchnick Theorem
The complexity of priority proofs in recursion theory has been growing since the first priority proofs in  and . Refined versions of classic priority proofs can be found in . To this date, this part of recursion theory is at about the same stage of development as real analysis was in the early days, when the notions of topology, continuity, compactness, vector space, inner product space, etc., were not invented. There were no general theorems involving these concepts to prove results about the real numbers and the proofs were repetitive and lengthy.
Unable to display preview. Download preview PDF.
- Groszek, M. and T. Slaman , Foundations of the priority method I, Finite and Infinite Injury (preprint).Google Scholar
- Kontostathis, K. , On the Construction of Degrees of Unsolvability. Ph.D. Thesis, Duke University, 1–44.Google Scholar
- Lempp, S. and M. Lerman , Priority Arguments Using Iterated Trees of Strategies. Lecture Notes in Mathematics 1432, Springer-Verlag.Google Scholar
- Muchnick, A. , On the unsolvability of the problem of reducibility in the theory of algorithms. Dokl. Akad. SSSR 108, 194–197.Google Scholar
- Nerode, A., A. Yakhnis and V. Yakhnis , Concurrent Programs as Strategies in Games. MSI Technical Report, Cornell University.Google Scholar
- Shoenfield, J. , Mathematical Logic. Addison-Wesley.Google Scholar
- Slaman, T. and W. Woodin , Collection and the Finite Injury Method. Mathematical Logic and its Applications, Lecture Notes in Mathematics 1388, Springer-Verlag.Google Scholar
- Soare, R. , Recursively Enumerable Sets and Degrees. Springer-Verlag.Google Scholar