戈德尔不完备定理董世平中原大学应用数学系教学讲义.pptVIP

戈德爾不完備定理董世平中原大學應用數學系;二十世紀數理邏輯之重大成果;二十世紀數理邏輯之重大成果; On January 14, 1978, Kurt G?del died in Princeton in his seventy-first year.There are those who believe that he was the most brilliant mind of the twentieth century. When Harvard University gave him an honorary degree*, the citation described him as “discoverer of the most significant mathematical truth of this century, incomprehensible to laymen, revolutionary for philosophers and logicians.”;The great abstract logical work of G?del had a striking outcome. In analyzing the forma; machinery of G?del’s description of what could be obtained by step-by-step procedures, the brilliant young English logician Alan Turing identified the results of such procedures-the general recursive functions-with the outcomes of what could be computed on a machine in general.;;第一不完備定理　　　任何一個足夠強的一致公設系統，必定是不完備的。　　　即除非這個系統很簡單（所以能敘述的不多），或是包含矛盾的，否則必有一真的敘述。第二不完備定理　　　任何一個足夠強的一致公設系統，必無法證明本身的一致性 　　所以除非這個系統很簡單，否則你若在此系統，證明了本身的一致性， 反而已顯出它是不一致的。;;;;　　　？　　　　　　　真　＝　可證明　　真　?　可證明　　一致性真　?　可證明　　完備性;Rucker, Infinity and the Mind; G?del asks for the program and the circuit design of the UTM. The program may be complicated, but it can only be finitely long. Call the program P(UTM) for Program of the Universal Truth Machine. Smiling a little, G?del writes out the following sentence: The machine constructed on the basis of the program P(UTM) will never say that this sentence is true. Call this sentence G for G?del. Note that G is equivalent to: UTM will never say G is true. ; Now G?del laughs his high laugh and asks UTM whether G is true or not. If UTM says G is true, then UTM will never say G is true is false. If UTM will never say G is true is false, then G is false (since G = UTM will never say G is true). So if UTM says G is true, then G is in fact false, and UTM has made a false statement. So UTM will never say that G is true, since UTM makes only true statements.; We have established that UTM will never say G is true. So UT