Calculable enumerations and equivalence relations

DOI10.1007/BF00969208MaRDI QIDQ579243zbMATH OpenFDO

Authors Z. G. Khisamiev

Publication date 1986

Published in Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

equivalence relationcomputable enumerationsenumerational equivalencefactor-families of fundamental families of recursively enmerable sets

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Reducibilities among equivalence relations induced by recursively enumerable structures
• scientific article; zbMATH DE number 4053598
• Graphs realised by r.e. equivalence relations
• scientific article; zbMATH DE number 218551
• Strong Reducibilities of Enumerations and Partial Enumerated Algebras

Cites work

• Computing degrees of unsolvability
• Nonconstructivizability of the reduced part of a strongly constructive torsion-free Abelian group
• On the Degrees of Index Sets
• On the Degrees of Index Sets. II

Cited in

(3)

• On mutually coherent enumerations of countable sets
• Graphs realised by r.e. equivalence relations
• A Friedberg enumeration of equivalence structures

This page was built for publication: Calculable enumerations and equivalence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579243)