Switch to: Citations

References in:

Computably enumerable sets and quasi-reducibility

R. Downey, G. LaForte & A. Nies

Annals of Pure and Applied Logic 95 (1-3):1-35 (1998)

Add references

You must login to add references.

Omitting quantifier-free types in generic structures.Angus Macintyre - 1972 - Journal of Symbolic Logic 37 (3):512-520.details Download Export citation Bookmark 8 citations
Structural interactions of the recursively enumerable T- and W-degrees.R. G. Downey & M. Stob - 1986 - Annals of Pure and Applied Logic 31:205-236.details Download Export citation Bookmark 12 citations
(1 other version)Review: A. H. Lachlan, Lower Bounds for Pairs of Recursively Enumerable Degrees. [REVIEW]Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (3):611-611.details Download Export citation Bookmark 29 citations
Quasicreative Sets.J. R. Shoenfield - 1960 - Journal of Symbolic Logic 25 (2):166-166.details Download Export citation Bookmark 2 citations
Admissible ordinals and priority arguments.Manuel Lerman - 1973 - In A. R. D. Mathias & Hartley Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 311--344.details Download Export citation Bookmark 6 citations
(1 other version)Ein Rekursiv Aufzählbarer btt‐Grad, der Nicht Zum Wortproblem Einer Gruppe Gehört.Martin Ziegler - 1976 - Mathematical Logic Quarterly 22 (1):165-168.details Download Export citation Bookmark 1 citation
(1 other version)Ein Rekursiv Aufzählbarer btt-Grad, der Nicht Zum Wortproblem Einer Gruppe Gehört.Martin Ziegler - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):165-168.details Download Export citation Bookmark 1 citation

1