Liste des Groupes | Revenir à c theory |
On 11/14/2024 8:42 PM, Richard Damon wrote:On 11/14/24 9:26 PM, olcott wrote:On 11/14/2024 5:53 PM, Richard Damon wrote:On 11/14/24 6:40 PM, olcott wrote:On 11/14/2024 2:39 AM, Mikko wrote:On 2024-11-13 23:01:50 +0000, olcott said:On 11/13/2024 4:45 AM, Mikko wrote:On 2024-11-12 23:17:20 +0000, olcott said:On 11/10/2024 2:36 PM, Alan Mackenzie wrote:olcott <polcott333@gmail.com> wrote:On 11/10/2024 1:04 PM, Alan Mackenzie wrote:
>Incomplete(L) ≡ ∃x ∈ Language(L) ((L ⊬ x) ∧ (L ⊬ ¬x))>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 DOES NOT GET RID OF>
INCOMPLETENESS.
The details are unimportant. Gödel's theorem is correct. Your
ideas 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.
>
That's correct (although T is usually used instead of L).
Per this definition the first order group theory and the first
order Peano arithmetic are incomplete.
Every language that can by any means express self-contradiction
incorrectly shows that its formal system is incomplete.
That "incorrectly shows" is non-sense. A language does not show,
incorrectly or otherwise. A proof shows but not incorrectly. But
for a proof you need a theory, i.e. more than just a language.
That a theory can't prove something is usually not provable in the
theory itself but usually needs be proven in another theory, one
that can be interpreted as a metatheory.
When you start with truth and only apply truth preserving operations
then you necessarily end up with truth.
But in FORMAL LOGIC, that analytic Truth is specified as the axioms ofRight, but that truth might not be PROVABLE (by a finite proof thatAll of analytic truth is specified as relations between expressions of
establishes Knowledge) as Truth is allowed to be established by
infinite chains.
language. When these relations do not exist neither does the truth of
these expressions.
the system, and the approved logical operations for the system.
You confuse "Formal Logic" with "Philosophy" due to your ignorance of
them.
Logic never has been free to override and supersede how truth itselfI am looking at this on the basis of how truth itself actually works.No, because you logic is based on LIES, because you are trying to
You are looking at this on the basis of memorized dogma.
redefine fundamental terms within the system, as opposed to doiing the
work to make a system the way you want, likely because you are just to
ignorant to do the work,
fundamentally works.
If Goldbach conjecture is true then there is some finite or infiniteYes. In the case of an infinite sequence we can not prove it.
sequence of truth preserving operations that shows this, otherwise it is
not true.
Les messages affichés proviennent d'usenet.