Latest update

- Rain 40 days after Shavous
- Why would it be disrespectful to G-d to say Miryam died “al pi Hashem”?
- Understanding the key concept
- Does 12-54 to 13-56 gauge change require a re-setup?
- SUM function in a calculated column
- Difference Between 2 Dates (number of hours beyond 24 hours)
- mystery no crank, no start
- Car vibrates and has mild drone at 15-45 mph
- EFQ SQL error when using filedCondition on two different taxonomy terms
- Breathing trouble during high intensity
- Was a finger ever grown back with “pixie dust”?
- Did Hillary Clinton say that North Korea requires experienced diplomats rather than tweets?
- What is the industry standard way of calculating and annualizing performance metrics?
- Why the difference between SPY and ^GSPC?
- Feedback on Website Code
- Readable implementation of Trie in Python
- What were the other 8 Nazgul doing while the Witch-King weakened Arnor?
- Actors appearing in both Star Trek and Star Wars?
- How to query inside jsonb column
- Extract max of value in Fact table using date filter

# 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?