The Combinatorics of the Friedberg-Muchnick Theorem

  • Kyriakos Kontostathis
Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 12)


The complexity of priority proofs in recursion theory has been growing since the first priority proofs in [1] and [7]. Refined versions of classic priority proofs can be found in [11]. 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.


Recursive Function Infinite Sequence Pigeon Hole Principle Empty Sequence Priority Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Friedberg, R. [1957], Two recursively enumerable sets of incomparable degrees of unsolvability. Proc. Nat. Acad. Sciences, USA 43, 236–238.MathSciNetzbMATHCrossRefGoogle Scholar
  2. [2]
    Groszek, M. and T. Slaman [1987], Foundations of the priority method I, Finite and Infinite Injury (preprint).Google Scholar
  3. [3]
    Kirby, L. and J. Paris [1978], Σ Collection schemas in Arithmetic. Logic Colloquium 77, North-Holland, Amsterdam, 199–209.zbMATHGoogle Scholar
  4. [4]
    Kontostathis, K. [1988], On the Construction of Degrees of Unsolvability. Ph.D. Thesis, Duke University, 1–44.Google Scholar
  5. [5]
    Kontostathis, K. [1991], Topological Framework for Non-priority. Zeits. f. Math. Logik, u. Grundl. der Math. 37, 495–500.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    Lempp, S. and M. Lerman [1990], Priority Arguments Using Iterated Trees of Strategies. Lecture Notes in Mathematics 1432, Springer-Verlag.Google Scholar
  7. [7]
    Muchnick, A. [1956], On the unsolvability of the problem of reducibility in the theory of algorithms. Dokl. Akad. SSSR 108, 194–197.Google Scholar
  8. [8]
    Nerode, A., A. Yakhnis and V. Yakhnis [1990], Concurrent Programs as Strategies in Games. MSI Technical Report, Cornell University.Google Scholar
  9. [9]
    Shoenfield, J. [1967], Mathematical Logic. Addison-Wesley.Google Scholar
  10. [10]
    Slaman, T. and W. Woodin [1989], Collection and the Finite Injury Method. Mathematical Logic and its Applications, Lecture Notes in Mathematics 1388, Springer-Verlag.Google Scholar
  11. [11]
    Soare, R. [1987], Recursively Enumerable Sets and Degrees. Springer-Verlag.Google Scholar

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • Kyriakos Kontostathis
    • 1
  1. 1.Department of MathematicsVillanova UniversityVillanovaUSA

Personalised recommendations