Lowness for isomorphism and degrees of genericity
From MaRDI portal
Publication:4608443
DOI10.3233/COM-170078zbMATH Open1435.03068MaRDI QIDQ4608443FDOQ4608443
Authors: Johanna N. Y. Franklin, Dan Turetsky
Publication date: 16 March 2018
Published in: Computability (Search for Journal in Brave)
Recommendations
Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Theory of numerations, effectively presented structures (03D45)
Cited In (10)
- STRUCTURAL HIGHNESS NOTIONS
- Degrees of and lowness for isometric isomorphism
- Lowness for isomorphism, countable ideals, and computable traceability
- Degrees that Are Low for Isomorphism
- Strength and weakness in computable structure theory
- Categoricity spectra of computable structures
- Strong degrees of categoricity and weak density
- Degrees of bi-embeddable categoricity
- Lowness for genericity
- Coding in the automorphism group of a computably categorical structure
This page was built for publication: Lowness for isomorphism and degrees of genericity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608443)