Weakly precomplete computably enumerable equivalence relations

DOI10.1002/malq.201500057zbMath1361.03043MaRDI QIDQ2793914

S. A. Badaev, Andrea Sorbi

Publication date: 17 March 2016

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

Full work available at URL: https://doi.org/10.1002/malq.201500057

zbMATH Keywords

index set; computably enumerable equivalence relation; precomplete

Mathematics Subject Classification ID

03D15: Complexity of computation (including implicit computational complexity)

03D30: Other degrees and reducibilities in computability and recursion theory

03D45: Theory of numerations, effectively presented structures

Related Items

On dark computably enumerable equivalence relations, Positive preorders, Weakly precomplete equivalence relations in the Ershov hierarchy, Boolean algebras realized by c.e. equivalence relations, A Survey on Universal Computably Enumerable Equivalence Relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On weakly pre-complete positive equivalences
• On the relation provable equivalence and on partitions in effectively inseparable sets
• Relatively precomplete numerations and arithmetic
• Positive equivalences
• UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
• A Note on Positive Equivalence Relations
• Classifying positive equivalence relations
• Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• A Theorem on Hypersimple Sets
• Computably enumerable equivalence relations