计算理论与符号逻辑 教学课件 作者 张兴元 王元元 宋丽华 cl 17.pdf

17 January 4, 2009 1 ( Cantor’s Theorem) P (N ) 1 ( Cantor’s Theorem) P (N ) . P (N ) L = S0 , S1 , S2 , ..., S , ..., i S ∈ P(N )nS = Sn S S (n)n ∈ S 1 ( Cantor’s Theorem) P (N ) . P (N ) L = S0 , S1 , S2 , ..., S , ..., i S ∈ P(N )nS = Sn S S (n)n ∈ S 1 i ∈ N iS S (n)S Sn i i i ∆(L) ∆(L)(n) ≡ ∼Sn (n) (1) 1 ( Cantor’s Theorem) P (N ) . P (N ) L = S0 , S1 , S2 , ..., S , ..., i S ∈ P(N )nS = Sn S S (n)n ∈ S 1 i ∈ N iS S (n)S Sn i i i ∆(L) ∆(L)(n) ≡ ∼Sn (n) (1) 2 ∆(L) ∈ P(N ) i ∆(L) = S ∆(L)L i 1 ( Cantor’s Theorem) P (N ) . P (N ) L = S0 , S1 , S2 , ..., S , ...,