Positive equivalences
From MaRDI portal
Cites work
Cited in
(28)- Irreducible, singular, and contiguous degrees
- Positive preorders
- Learnability and positive equivalence relations
- Computable embeddability for algebraic structures
- A note on joins and meets for positive linear preorders
- Weakly precomplete equivalence relations in the Ershov hierarchy
- On dark computably enumerable equivalence relations
- On isomorphism classes of computably enumerable equivalence relations
- \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
- A survey on universal computably enumerable equivalence relations
- Fixed point theorems for precomplete numberings
- Computable reducibility for computable linear orders of type \(\omega \)
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Index sets for classes of positive preorders
- \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
- Weakly precomplete computably enumerable equivalence relations
- On computably enumerable structures
- Maximal r.e. equivalence relations
- On universal positive graphs
- Jumps of computably enumerable equivalence relations
- \(\Sigma^ n_ 0\)-equivalence relations
- Graphs realised by r.e. equivalence relations
- NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES
- The theory of ceers computes true arithmetic
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies
- The structure of computably enumerable preorder relations
- On a conjecture of Bergstra and Tucker
- The category of equivalence relations
This page was built for publication: Positive equivalences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1393225)