Liste des Groupes | Revenir à theory |
Since generations logicians have called sentencesThat is the same as calling a dead-cow a cow that does
which you clumsily call "not a truth-bearer",
simple called "undecidable" sentences.
A theory is incomplete, if it has undecidableIf an expression of language is WRONG then we can't
sentences. There is a small difference between
unprovable and undecidable.
An unprovable senetence A is only a sentence with:The problem with this is that self-contradictory sentences
~True(L, A).
An undecidable sentence A is a sentence with:
~True(L, A) & ~True(L, ~A)
Meaning the sentence itself and its complement"This sentence is not true" IS WRONG.
are both unprovable.
olcott schrieb:--~True(L,x) ∧ ~True(L,~x)
means that x is not a truth-bearer in L.
It does not mean that L is incomplete
Les messages affichés proviennent d'usenet.