Pages that link to "Item:Q762063"
From MaRDI portal
The following pages link to Some undecidability results for lattices in recursion theory (Q762063):
Displaying 17 items.
- Some highly undecidable lattices (Q584255) (← links)
- Recursive properties of relations on models (Q687281) (← links)
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures (Q1083446) (← links)
- Maximal theories (Q1093629) (← links)
- 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)
- The undecidability of the elementary theory of lattices of all equational theories of large signature (Q2311327) (← links)
- More undecidable lattices of Steinitz exchange systems (Q3149998) (← links)
- (Q3362714) (← links)
- A survey of lattices of r. e. substructures (Q3690803) (← links)
- (Q3734391) (← links)
- Recursion theory in a lower semilattice (Q4032870) (← links)
- (Q4285797) (← links)
- Maximal r.e. equivalence relations (Q5752560) (← links)
