Reducibilities among equivalence relations induced by recursively enumerable structures
From MaRDI portal
(Redirected from Publication:896924)
Recommendations
Cites work
- scientific article; zbMATH DE number 4053598 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- A Note on Positive Equivalence Relations
- COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classifying positive equivalence relations
- Computably enumerable equivalence relations
- Equivalence Relations on Classes of Computable Structures
- Finitely presented expansions of computably enumerable semigroups
- Graphs realised by r.e. equivalence relations
- Infinite time decidable equivalence relation theory
- Initial segments of recursive linear orders
- Isomorphism relations on computable structures
- Linear orders realized by c.e. equivalence relations
- On the relation provable equivalence and on partitions in effectively inseparable sets
- On Σ1 1 equivalence relations over the natural numbers
- Positive equivalences
- Quantifying the amount of verboseness
- Recursion theoretic properties of frequency computation and bounded queries
- Rekursive Algebren mit Kettenbedingungen
- Semirecursive Sets and Positive Reducibility
- Strong isomorphism reductions in complexity theory
- The effective theory of Borel equivalence relations
- The hierarchy of equivalence relations on the natural numbers under computable reducibility
Cited in
(32)- On the main scientific achievements of Victor Selivanov
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Learnability and positive equivalence relations
- Combinatorics of reductions between equivalence relations
- Calculable enumerations and equivalence relations
- Initial segments of the degrees of ceers
- scientific article; zbMATH DE number 4116518 (Why is no real title available?)
- Subrecursive equivalence relations and (non-)closure under lattice operations
- On recursively enumerable structures
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
- scientific article; zbMATH DE number 1404138 (Why is no real title available?)
- A survey on universal computably enumerable equivalence relations
- Learnability and positive equivalence relations
- Comparing Classes of Finite Structures
- Classifying word problems of finitely generated algebras via computable reducibility
- Well-orders realized by C.E. equivalence relations
- Linear orders realized by c.e. equivalence relations
- Measuring the complexity of reductions between equivalence relations
- Reducibility of equivalence relations arising from nonstationary ideals under large cardinal assumptions
- Boolean algebras realized by c.e. equivalence relations
- Uniformly computably separable algebras with effectively splittable families of negative congruences
- On isomorphism classes of computably enumerable equivalence relations
- Universal recursion theoretic properties of r.e. preordered structures
- On computably enumerable structures
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- On dark computably enumerable equivalence relations
- The complexity of index sets of classes of computably enumerable equivalence relations
- On the degree structure of equivalence relations under computable reducibility
- Positive preorders
- On learning down-sets in quasi-orders, and ideals in Boolean algebras
- Index sets for classes of positive preorders
- Graphs realised by r.e. equivalence relations
This page was built for publication: Reducibilities among equivalence relations induced by recursively enumerable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896924)
