UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

DOI10.1017/jsl.2013.8zbMath1338.03076MaRDI QIDQ2921020

Keng Meng Ng, Andrea Sorbi, Uri Andrews, Joseph S. Miller, Steffen Lempp, Luca San Mauro

Publication date: 30 September 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2013.8

zbMATH Keywords

computably enumerable equivalence relations; effectively inseparable sets

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

A Friedberg enumeration of equivalence structures, ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, On dark computably enumerable equivalence relations, Jumps of computably enumerable equivalence relations, Elementary theories and hereditary undecidability for semilattices of numberings, Positive preorders, On the degree structure of equivalence relations under computable reducibility, On \(\Delta_2^0\)-categoricity of equivalence relations, Graphs realised by r.e. equivalence relations, Boolean algebras realized by c.e. equivalence relations, Weakly precomplete computably enumerable equivalence relations, A Survey on Universal Computably Enumerable Equivalence Relations

Cites Work

• Unnamed Item
• The effective theory of Borel equivalence relations
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Relatively precomplete numerations and arithmetic
• Undecidable fragments of elementary theories
• Initial segments of one-one degrees
• Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
• Periodicity in generations of automata
• Remarks on Uniformly Finitely Precomplete Positive Equivalences