A survey on universal computably enumerable equivalence relations
From MaRDI portal
(Redirected from Publication:2970971)
Recommendations
Cites work
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A Note on Positive Equivalence Relations
- Classifying positive equivalence relations
- Computability theory
- Computably enumerable equivalence relations
- Creative Functions
- Creative sets
- Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
- Equivalence relations that are ^0_3 complete for computable reducibility (extended abstract)
- Graphs realised by r.e. equivalence relations
- Isomorphism relations on computable structures
- Linear orders realized by c.e. equivalence relations
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
- On the relation provable equivalence and on partitions in effectively inseparable sets
- On weakly pre-complete positive equivalences
- Positive equivalences
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Relatively precomplete numerations and arithmetic
- Remarks on Uniformly Finitely Precomplete Positive Equivalences
- The complexity of index sets of classes of computably enumerable equivalence relations
- The hierarchy of equivalence relations on the natural numbers under computable reducibility
- Theorie der Numerierungen I
- Theory of Formal Systems. (AM-47)
- Universal computably enumerable equivalence relations
- Weakly precomplete computably enumerable equivalence relations
Cited in
(34)- Well-orders realized by C.E. equivalence relations
- Two results on complexities of decision problems of groups
- Elementary theories and hereditary undecidability for semilattices of numberings
- On computable numberings of families of Turing degrees
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
- Primitive recursive equivalence relations and their primitive recursive complexity
- Subrecursive equivalence relations and (non-)closure under lattice operations
- Boolean algebras realized by c.e. equivalence relations
- Special classes of positive preorders
- Computable embeddability for algebraic structures
- A note on joins and meets for positive linear preorders
- On the theory of computably enumerable linear preorders with concatenation
- Initial segments of the degrees of ceers
- Weakly precomplete equivalence relations in the Ershov hierarchy
- On dark computably enumerable equivalence relations
- On isomorphism classes of computably enumerable equivalence relations
- Fixed point theorems in computability theory
- Numberings, c.e. oracles, and fixed points
- Partial combinatory algebra and generalized numberings
- Fixed point theorems for precomplete numberings
- Computable reducibility for computable linear orders of type
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- Index sets for classes of positive preorders
- Fixpoints and relative precompleteness
- Universal computably enumerable equivalence relations
- Classifying word problems of finitely generated algebras via computable reducibility
- Computably discrete represented spaces
- On universal positive graphs
- Word problems and ceers
- Computably enumerable equivalence relations via primitive recursive reductions
- Classifying equivalence relations in the Ershov hierarchy
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies
- The structure of computably enumerable preorder relations
- The category of equivalence relations
This page was built for publication: A survey on universal computably enumerable equivalence relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970971)
