Deutsch   English   Français   Italiano  
<861bb85bccca6c3ea77d43191a71cba4047a8e84@i2pn2.org>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: joes <noreply@example.org>
Newsgroups: comp.theory
Subject: Re: The philosophy of logic reformulates existing ideas on a new
 basis --- infallibly correct
Date: Fri, 15 Nov 2024 11:14:21 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <861bb85bccca6c3ea77d43191a71cba4047a8e84@i2pn2.org>
References: <vfli1h$fj8s$1@dont-email.me> <vgo157$n00$1@news.muc.de>
	<vgo4ia$3sfle$1@dont-email.me> <vgo7ri$30iv$1@news.muc.de>
	<vgo89i$3t6n8$1@dont-email.me> <vgoand$2464$1@news.muc.de>
	<vgobg7$3tnrn$2@dont-email.me> <vgodcf$kll$1@news.muc.de>
	<vgoed9$3ucjr$1@dont-email.me> <vgoi51$kll$2@news.muc.de>
	<vgojp1$3v611$1@dont-email.me> <vgol50$kll$3@news.muc.de>
	<vgom8r$3vue8$1@dont-email.me> <vgonlv$kll$4@news.muc.de>
	<vgoqv6$qht$2@dont-email.me> <vgq0dv$1trm$1@news.muc.de>
	<vgqifj$e0q0$2@dont-email.me> <vgqnfl$2ca0$1@news.muc.de>
	<vgqt2v$gdj5$2@dont-email.me> <vgr04c$dfn$1@news.muc.de>
	<vgr3vt$hf6i$2@dont-email.me> <vgr5fv$dfn$2@news.muc.de>
	<vh0nm0$1qvhf$1@dont-email.me> <vh2011$25mt3$1@dont-email.me>
	<vh3b4u$2e37l$4@dont-email.me> <vh4cvt$2nnn2$1@dont-email.me>
	<vh61p3$32617$1@dont-email.me>
	<711f1587cc9742bc67f5d27cac3832b697eaed5c@i2pn2.org>
	<vh6bhh$33nek$1@dont-email.me>
	<6c6be002ffd0ce36a57c621d6657db574c1ea16c@i2pn2.org>
	<vh6dd0$33u6t$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 15 Nov 2024 11:14:21 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2563854"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="nS1KMHaUuWOnF/ukOJzx6Ssd8y16q9UPs1GZ+I3D0CM";
User-Agent: Pan/0.145 (Duplicitous mercenary valetism; d7e168a
 git.gnome.org/pan2)
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 5746
Lines: 80

Am Thu, 14 Nov 2024 20:58:40 -0600 schrieb olcott:
> 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:

>>>>>>>>>>>> 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.
>>>>>>>>>>
>>>>>>>>> Incomplete(L) ≡  ∃x ∈ Language(L) ((L ⊬ x) ∧ (L ⊬ ¬x))
>>>>>>>>
>>>>>>>> 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.

>>>> Right, but that truth might not be PROVABLE (by a finite proof that
>>>> establishes Knowledge) as Truth is allowed to be established by
>>>> infinite chains.
>>> All of analytic truth is specified as relations between expressions of
>>> language. When these relations do not exist neither does the truth of
>>> these expressions.
>> But in FORMAL LOGIC, that analytic Truth is specified as the axioms of
>> the system, and the approved logical operations for the system.
>> You confuse "Formal Logic" with "Philosophy" due to your ignorance of
>> them.

This.

>>> I am looking at this on the basis of how truth itself actually works.
>>> You are looking at this on the basis of memorized dogma.
>> No, because you logic is based on LIES, because you are trying to
>> 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,
> Logic never has been free to override and supersede how truth itself
> fundamentally works.

Logic is just a formal system. The semantics/interpretation might
be wanted to correspond to common-sense truth. Truth inside a
logical system can be totally unrelated. Is the philosophical
debate on what truth is even finished?

> If Goldbach conjecture is true then there is some finite or infinite
> sequence of truth preserving operations that shows this, otherwise it is
> not true.
Yes. In the case of an infinite sequence we can not prove it.

-- 
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.