Turing computable embeddings of equivalences other than isomorphism

DOI10.1090/S0002-9939-2014-11878-8zbMath1349.03048OpenAlexW2163449161MaRDI QIDQ5401521

No author found.

Publication date: 13 March 2014

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-2014-11878-8

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

Turing computable embeddings, computable infinitary equivalence, and linear orders

Cites Work

• Unnamed Item
• Unnamed Item
• The effective theory of Borel equivalence relations
• Turing Computability
• A Borel reductibility theory for classes of countable structures
• Borel Equivalence Relations
• The relation of recursive isomorphism for countable structures
• Equivalence Relations on Classes of Computable Structures
• Turing computable embeddings
• Comparing Classes of Finite Structures

This page was built for publication: Turing computable embeddings of equivalences other than isomorphism