チューリング次数
As discussed above, is not arithmetically definable, by Tarski's theorem. A corollary of Post's theorem establishes that the Turing degree of is 0(ω), and so is not decidable nor recursively enumerable.