返信元の記事 | |||
【85】 | RE:英語で話ができる部屋 不完全確率 (2013年10月27日 00時12分) |
||
わたしももう寝るので続きがしたければ明日ね。 ところでIDをころころ替えるのは意味があるの? ただの遊び? |
■ 698件の投稿があります。 |
70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 |
【134】 |
David_Hilbert (2013年10月30日 03時40分) |
||
これは 【85】 に対する返信です。 | |||
Sehr geehrter Herr Doktor, ich glaube, Sie Deuch Koennen. Bitte uebersetzen Sie der folgenden Englisch zu den Deutsch und Japanisch, in der zwei Naechte. Logic: The liar paradox is the sentence "This sentence is false." An analysis of the liar sentence shows that it cannot be true (for then, as it asserts, it is false), nor can it be false (for then, it is true). A Goedel sentence G for a theory T makes a similar assertion to the liar sentence, but with truth replaced by provability: G says "G is not provable in the theory T." The analysis of the truth and provability of G is a formalized version of the analysis of the truth of the liar sentence. It is not possible to replace "not provable" with "false" in a Goedel sentence because the predicate "Q is the Goedel number of a false formula" cannot be represented as a formula of arithmetic. This result, known as Tarski's undefinability theorem, was discovered independently by Goedel (when he was working on the proof of the incompleteness theorem) and by Alfred Tarski. |
|||
70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 |
© P-WORLD