Universal computably enumerable equivalence relations
From MaRDI portal
Recommendations
- Computably enumerable equivalence relations
- A survey on universal computably enumerable equivalence relations
- Equivalence Relations on Classes of Computable Structures
- On isomorphism classes of computably enumerable equivalence relations
- Relative computability and uniform continuity of relations
- Equivalence relations in set theory, computation theory, model theory and complexity theory
- Weakly precomplete computably enumerable equivalence relations
- Universal Relations and #P-Completeness
- Equivalence relations and determinacy
- Jumps of computably enumerable equivalence relations
Cites work
- Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Initial segments of one-one degrees
- On the relation provable equivalence and on partitions in effectively inseparable sets
- Periodicity in generations of automata
- Relatively precomplete numerations and arithmetic
- Remarks on Uniformly Finitely Precomplete Positive Equivalences
- The effective theory of Borel equivalence relations
- Undecidable fragments of elementary theories
Cited in
(41)- On dark computably enumerable equivalence relations
- Jumps of computably enumerable equivalence relations
- Elementary theories and hereditary undecidability for semilattices of numberings
- Positive preorders
- Effective inseparability and its applications
- Completeness of the hyperarithmetic isomorphism equivalence relation
- Index sets for classes of positive preorders
- The theory of ceers computes true arithmetic
- Classifying equivalence relations in the Ershov hierarchy
- The structure of computably enumerable preorder relations
- On the degree structure of equivalence relations under computable reducibility
- On \(\Delta_2^0\)-categoricity of equivalence relations
- Graphs realised by r.e. equivalence relations
- Boolean algebras realized by c.e. equivalence relations
- On universal positive graphs
- Weakly precomplete computably enumerable equivalence relations
- A survey on universal computably enumerable equivalence relations
- The complexity of index sets of classes of computably enumerable equivalence relations
- Ulm Classification of Analytic Equivalence Relations in Generic Universes
- A Friedberg enumeration of equivalence structures
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- The first-order theory of the computably enumerable equivalence relations in the uncountable setting
- Primitive recursive equivalence relations and their primitive recursive complexity
- Fixpoints and relative precompleteness
- Initial segments of the degrees of ceers
- On isomorphism classes of computably enumerable equivalence relations
- Joins and meets in the structure of ceers
- Computable embeddability for algebraic structures
- Agreement reducibility
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
- Word problems and ceers
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
- Computable reducibility for computable linear orders of type
- A note on joins and meets for positive linear preorders
- Computably discrete represented spaces
- Computably enumerable equivalence relations via primitive recursive reductions
- Countable and finitary reductions on equivalence relations
- Defining algorithmically presented structures in first order logic
- Two results on complexities of decision problems of groups
- One question of the theory of numbered groups
- Limit learning equivalence structures
This page was built for publication: Universal computably enumerable equivalence relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921020)
