Pages that link to "Item:Q762063"
From MaRDI portal
The following pages link to Some undecidability results for lattices in recursion theory (Q762063):
Displayed 7 items.
- The undecidability of the lattice of r. e. closed subsets of an effective topological space (Q1098841) (← links)
- Recursive versus recursively enumerable binary relations (Q1319364) (← links)
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- Subrecursive equivalence relations and (non-)closure under lattice operations (Q2117798) (← links)
- The theory of ceers computes true arithmetic (Q2187270) (← links)
- Recursion theory in a lower semilattice (Q4032870) (← links)
- Maximal r.e. equivalence relations (Q5752560) (← links)