Switch to: Citations

References in:

Complexity of equivalence relations and preorders from computability theory

Egor Ianovski, Russell Miller, Keng Meng Ng & André Nies

Journal of Symbolic Logic 79 (3):859-881 (2014)

Add references

You must login to add references.

The intervals of the lattice of recursively enumerable sets determined by major subsets.Wolfgang Maass & Michael Stob - 1983 - Annals of Pure and Applied Logic 24 (2):189-212.details Logic and Philosophy of Logic Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Model Theory in Logic and Philosophy of Logic Direct download (3 more) Export citation Bookmark 11 citations
Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.details Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Model Theory in Logic and Philosophy of Logic Direct download (2 more) Export citation Bookmark 10 citations
Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.details Areas of Mathematics in Philosophy of Mathematics Direct download (2 more) Export citation Bookmark 11 citations

1