(From
GGCC) Let
A={n:φn(n)=0} and
B={n:φn(n)=1}, then
A and
B are both
c.e. Also, they are c.i., as follows.
Assume for contradiction existence of
computable C with
C⊋A and
C∩B=∅. Since
C is
computable then exists
c so that the
indicator function 1C is equal to
φc. Then:
c∈Cdefn of 1c⟹1c(c)=1defn of c⟹φc(c)=1defn of B⟹c∈BC∩B=∅⟹c∈/Cand
c∈/Cdefn of 1c⟹1c(c)=0defn of c⟹φc(c)=0defn of A⟹c∈AA⊆C⟹c∈C
And
c∈C⟺c∈/C is a contradiction. Hence the assumption that
C exists must be false.