The undecidability of the lattice of r. e. closed subsets of an effective topological space
From MaRDI portal
Publication:1098841
DOI10.1016/0168-0072(87)90063-7zbMath0637.03041OpenAlexW2066136688MaRDI QIDQ1098841
Sheryl Silibovsky Brady, Jeffery B. Remmel
Publication date: 1987
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(87)90063-7
Undecidability and degrees of sets of sentences (03D35) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Some undecidability results for lattices in recursion theory
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
- Simplicity in effective topology
- The undecidability of the recursively enumerable degrees
- Recursive constructions in topological spaces
- A universal embedding property of the RETs
- Undecidability of Some Topological Theories
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item