Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Rogers Jr., H.: Theory of recursive functions and effective computability. McGraw-Hill Book Company, New York (1967)
2. Selman, A.: Arithmetical reducibilities I. Z. Math. Logik Grundlag. Math. 17, 335–350 (1971)
3. Case, J.: Maximal arithmetical reducibilities. Z. Math. Logik Grundlag. Math. 20, 261–270 (1974)
4. Ash, C.: Generalizations of enumeration reducibility using recursive infinitary propositional sentences. Ann. Pure Appl. Logic 58, 173–184 (1992)
5. Cooper, S.: Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense. J. Symbolic Logic 49, 503–513 (1984)