Pages that link to "Item:Q5388722"
From MaRDI portal
The following pages link to Isomorphism relations on computable structures (Q5388722):
Displayed 27 items.
- Comparing classes of finite sums (Q282120) (← links)
- Complexity of the isomorphism problem for computable free projective planes of finite rank (Q721371) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- Jumps of computably enumerable equivalence relations (Q1693042) (← links)
- Enumerating classes of effective quasi-Polish spaces (Q2104255) (← links)
- Completeness of the hyperarithmetic isomorphism equivalence relation (Q2143655) (← links)
- The theory of ceers computes true arithmetic (Q2187270) (← links)
- Classifying equivalence relations in the Ershov hierarchy (Q2204368) (← links)
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies (Q2207013) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- On computably enumerable structures (Q2263114) (← links)
- Graphs realised by r.e. equivalence relations (Q2349100) (← links)
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces (Q2682909) (← links)
- COMPUTABLE ABELIAN GROUPS (Q2795203) (← links)
- A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971) (← links)
- Torsion-free abelian groups with optimal Scott families (Q4565755) (← links)
- Computable topological groups and Pontryagin duality (Q4691089) (← links)
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS (Q5027663) (← links)
- DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS (Q5052017) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)
- Souslin quasi-orders and bi-embeddability of uncountable structures (Q5097134) (← links)
- Bi‐embeddability spectra and bases of spectra (Q5108859) (← links)
- Computable embeddability for algebraic structures (Q5876742) (← links)
- Agreement reducibility (Q6047663) (← links)
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS (Q6095972) (← links)
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR (Q6103452) (← links)
- STRUCTURAL HIGHNESS NOTIONS (Q6140191) (← links)