Pages that link to "Item:Q896924"

The following pages link to Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924):

Displaying 31 items.

• Calculable enumerations and equivalence relations (Q579243) (← links)
• On dark computably enumerable equivalence relations (Q1642296) (← links)
• Positive preorders (Q1757648) (← links)
• On recursively enumerable structures (Q1919770) (← links)
• Well-orders realized by C.E. equivalence relations (Q2104248) (← links)
• Subrecursive equivalence relations and (non-)closure under lattice operations (Q2117798) (← links)
• Index sets for classes of positive preorders (Q2165608) (← links)
• Learnability and positive equivalence relations (Q2232273) (← links)
• On computably enumerable structures (Q2263114) (← links)
• Reducibility of equivalence relations arising from nonstationary ideals under large cardinal assumptions (Q2295738) (← links)
• On the degree structure of equivalence relations under computable reducibility (Q2295742) (← links)
• Graphs realised by r.e. equivalence relations (Q2349100) (← links)
• Combinatorics of reductions between equivalence relations (Q2352075) (← links)
• Boolean algebras realized by c.e. equivalence relations (Q2403654) (← links)
• Uniformly computably separable algebras with effectively splittable families of negative congruences (Q2671977) (← links)
• A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971) (← links)
• THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q2976337) (← links)
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS (Q3188324) (← links)
• Recursively Enumerable Equivalence Relations Modulo Finite Differences (Q4315325) (← links)
• Effective properties of finitely generated r.e. algebras (Q4850551) (← links)
• (Q4937819) (← links)
• EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS (Q5027663) (← links)
• INITIAL SEGMENTS OF THE DEGREES OF CEERS (Q5100062) (← links)
• ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q5107218) (← links)
• Measuring the complexity of reductions between equivalence relations (Q5211066) (← links)
• COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR (Q6103452) (← links)
• Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)
• On the main scientific achievements of Victor Selivanov (Q6146819) (← links)
• Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)
• Learnability and positive equivalence relations (Q6186308) (← links)
• On learning down-sets in quasi-orders, and ideals in Boolean algebras (Q6661766) (← links)