Lowness for isomorphism, countable ideals, and computable traceability
- 1 March 2020
- journal article
- research article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 66 (1) , 104-114
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Simons Foundation (420806)
This publication has 9 references indexed in Scilit:
- Taking the path computably traveledJournal of Logic and Computation, 2019
- Lowness for isomorphism and degrees of genericityComputability, 2017
- Degrees that Are Low for IsomorphismComputability, 2014
- Algorithmic Randomness and Complexity2010
- Degree spectra and computable dimensions in algebraic structuresAnnals of Pure and Applied Logic, 2002
- Computational randomness and lownessThe Journal of Symbolic Logic, 2001
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterionThe Journal of Symbolic Logic, 1989
- Recursively Enumerable Sets and Degrees1987
- Degrees of members of Π10classesPacific Journal of Mathematics, 1972