Pages that link to "Item:Q3337460"
From MaRDI portal
The following pages link to Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets (Q3337460):
Displaying 12 items.
- Friedberg splittings of recursively enumerable sets (Q685058) (← links)
- Computably enumerable sets and related issues (Q695800) (← links)
- Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures'' (Q749526) (← links)
- The intervals of the lattice of recursively enumerable sets determined by major subsets (Q793018) (← links)
- Degrees of orderings not isomorphic to recursive linear orderings (Q810503) (← links)
- Automorphisms of the lattice of recursively enumerable sets: Orbits (Q1186287) (← links)
- Definable properties of the computably enumerable sets (Q1295410) (← links)
- Splitting theorems in recursion theory (Q1314544) (← links)
- Effectively categorical abelian groups (Q2377433) (← links)
- Computably enumerable sets that are automorphic to low sets (Q2964278) (← links)
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets (Q4018916) (← links)
- Isomorphism of lattices of recursively enumerable sets (Q4337954) (← links)