Weakly precomplete computably enumerable equivalence relations
From MaRDI portal
Publication:2793914
DOI10.1002/malq.201500057zbMath1361.03043OpenAlexW2294316973MaRDI QIDQ2793914
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
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)
Related Items (11)
On dark computably enumerable equivalence relations ⋮ Index sets for classes of positive preorders ⋮ Boolean algebras realized by c.e. equivalence relations ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ On universal positive graphs ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ The structure of computably enumerable preorder relations ⋮ Positive preorders ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy ⋮ Computable embeddability for algebraic structures
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
This page was built for publication: Weakly precomplete computably enumerable equivalence relations
