Latest update

- How did the early Macintoshes update the display?
- Implementing function to transact with other ERC-20 tokens in smart contract?
- TypeError: Cannot read property 'call' of undefined
- Set method name for MetaMask history
- How Blockapps's REST-API work?
- How to use specific version of web3
- How to prevent a token from being exchanged freely
- Extruder/nozzle keeps clogging up
- Corner of origin in different image formats
- Dual boot issue
- Нереализованные или не реализованные?
- Разбор слов по составу
- Benefits of multiple membrane sweeps
- CiviCase - remember user choices in search filters for activities
- Installing Webform CiviCRM from an Installation Profile
- “diff”-ing current with “earlier” time
- Mapping ESC key to toggle command/insert modes
- how reformat kegg reconstruct pathway in linux?
- How to actually control slip?
- LC oscillator circuit

# There exist countably many enumerable disjoint and inseparable sets

2017-10-17 20:08:44

I want to formally prove that there are countably many disjoint enumerable sets such that any two of them cannot be separated by a decidable set.

I know that there exist a computable function $f$ that takes only values 0 and 1, and this can be used to define two sets (let's say $\mathcal{A}$ and $\mathcal{B}$, where $\mathcal{A}=\{x$ $s.t. f(x)=1\}$ and $\mathcal{B}=\{x$ $ s.t. f(x)=0\}$).

Could you please help me to extend this arguments to find (countably) many such sets?