Lowness for isomorphism, countable ideals, and computable traceability

DOI10.1002/MALQ.201900066OpenAlexW3010831302MaRDI QIDQ5112396

Johanna N. Y. Franklin, D. Reed Solomon

Publication date: 29 May 2020

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.06003

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (1)

STRUCTURAL HIGHNESS NOTIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Degree spectra and computable dimensions in algebraic structures
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Computational randomness and lowness
• Algorithmic Randomness and Complexity
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• Lattice embeddings into the recursively enumerable degrees
• Lowness for isomorphism and degrees of genericity
• Degrees that Are Low for Isomorphism
• Taking the path computably traveled

This page was built for publication: Lowness for isomorphism, countable ideals, and computable traceability