Liste des Groupes | Revenir à c theory |
On 11/10/2024 2:36 PM, Alan Mackenzie wrote:That's correct (although T is usually used instead of L).olcott <polcott333@gmail.com> wrote:Incomplete(L) ≡ ∃x ∈ Language(L) ((L ⊬ x) ∧ (L ⊬ ¬x))On 11/10/2024 1:04 PM, Alan Mackenzie wrote:[ .... ]
I have addressed your point perfectly well. Gödel's theorem is correct,
therefore you are wrong. What part of that don't you understand?YOU FAIL TO SHOW THE DETAILS OF HOW THIS DOESThe details are unimportant. Gödel's theorem is correct. Your ideas
NOT GET RID OF INCOMPLETENESS.
contradict that theorem. Therefore your ideas are incorrect. Again, the
precise details are unimportant, and you wouldn't understand them
anyway. Your ideas are as coherent as 2 + 2 = 5.
When the above foundational definition ceases to exist thenI doesn't cease to exist.
Gödel's proof cannot prove incompleteness.
Les messages affichés proviennent d'usenet.