“Either
T is small, in which case it might be
c.e., or it’s large, in which case it might be
complete, but never both”
Proof sketch — if
T were
c.e. then it would be
decidable. If it were also
complete then we could decide all of
Th((N,+,×)); contradiction.