| Next | Topology of Data Types | 12 |
Let X be the set of all strings over some alphabet
Certainly X is semidecidable
Certainly the empty set is semidecidable
If A and B are semidecidable, so is A ∩ B
If ℱ is an infinite family of semidecidable sets, ∪ℱ is a semidecidable set
| Next |