Switch to: References

Add citations

You must login to add citations.
  1. The undecidability of the lattice of R.E. closed subsets of an effective topological space.Sheryl Silibovsky Brady & Jeffrey B. Remmel - 1987 - Annals of Pure and Applied Logic 35 (C):193-203.
    The first-order theory of the lattice of recursively enumerable closed subsets of an effective topological space is proved undecidable using the undecidability of the first-order theory of the lattice of recursively enumerable sets. In particular, the first-order theory of the lattice of recursively enumerable closed subsets of Euclidean n -space, for all n , is undecidable. A more direct proof of the undecidability of the lattice of recursively enumerable closed subsets of Euclidean n -space, n ⩾ 2, is provided using (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • The undecidability of the lattice of r.e. closed subsets of an effective topological space.S. Silibovsky Brady - 1987 - Annals of Pure and Applied Logic 35:193.
    The first-order theory of the lattice of recursively enumerable closed subsets of an effective topological space is proved undecidable using the undecidability of the first-order theory of the lattice of recursively enumerable sets. In particular, the first-order theory of the lattice of recursively enumerable closed subsets of Euclidean n -space, for all n, is undecidable. A more direct proof of the undecidability of the lattice of recursively enumerable closed subsets of Euclidean n -space, n ⩾ 2, is provided using the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•