Weakly precomplete computably enumerable equivalence relations

DOI10.1002/MALQ.201500057MaRDI QIDQ2793914zbMATH OpenOpenAlexFDO

Authors Serikzhan A. Badaev, Andrea Sorbi

Publication date 17 March 2016

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

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

zbMATH Keywords

computably enumerable equivalence relationindex setprecomplete

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Recommendations

• The complexity of index sets of classes of computably enumerable equivalence relations
• On isomorphism classes of computably enumerable equivalence relations
• Equivalence relations that are ^0_3 complete for computable reducibility (extended abstract)
• Weakly precomplete equivalence relations in the Ershov hierarchy
• Universal computably enumerable equivalence relations

Cites work

• A Note on Positive Equivalence Relations
• A Theorem on Hypersimple Sets
• Classifying positive equivalence relations
• Computably enumerable equivalence relations
• Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3532928 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On the relation provable equivalence and on partitions in effectively inseparable sets
• On weakly pre-complete positive equivalences
• Positive equivalences
• Relatively precomplete numerations and arithmetic
• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• Universal computably enumerable equivalence relations

Cited in

(16)

• On dark computably enumerable equivalence relations
• Positive preorders
• Index sets for classes of positive preorders
• The structure of computably enumerable preorder relations
• Weakly precomplete equivalence relations in the Ershov hierarchy
• Boolean algebras realized by c.e. equivalence relations
• Minimal generalized computable numberings and families of positive preorders
• On universal positive graphs
• Universal computably enumerable equivalence relations
• A survey on universal computably enumerable equivalence relations
• The complexity of index sets of classes of computably enumerable equivalence relations
• On isomorphism classes of computably enumerable equivalence relations
• Computable embeddability for algebraic structures
• On diagonal functions for equivalence relations
• Fixed point theorems in computability theory
• On weakly pre-complete positive equivalences

This page was built for publication: Weakly precomplete computably enumerable equivalence relations

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