Deutsch   English   Français   Italiano  
<8c2cbbe343934d211ad8c820c963702e70351a27@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: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: The philosophy of logic reformulates existing ideas on a new
 basis ---
Date: Fri, 8 Nov 2024 13:02:47 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <8c2cbbe343934d211ad8c820c963702e70351a27@i2pn2.org>
References: <vfli1h$fj8s$1@dont-email.me> <vg4uem$3o3ca$1@dont-email.me>
 <vg7f7l$a1jf$1@dont-email.me> <vg8ulh$9stc$1@dont-email.me>
 <vgakbd$vlda$1@dont-email.me> <vgbm5r$sgg9$1@dont-email.me>
 <vgg6fh$2s61$1@news.muc.de> <vgg7tk$26klj$1@dont-email.me>
 <vggjtb$1f3u$1@news.muc.de> <vggund$2am72$1@dont-email.me>
 <vgkudf$1lrm$1@news.muc.de> <vgl78d$37h38$2@dont-email.me>
 <vgl9cm$6e3$1@news.muc.de> <vgl9uh$37h38$9@dont-email.me>
 <vglcnh$agb$1@news.muc.de> <vgldr3$38uph$1@dont-email.me>
 <vglfui$agb$2@news.muc.de> <vglhij$39mg2$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Fri, 8 Nov 2024 18:02:48 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1555370"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <vglhij$39mg2$1@dont-email.me>
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 3576
Lines: 41

On 11/8/24 12:25 PM, olcott wrote:

> 
> That formal systems that only apply truth preserving
> operations to expressions of their formal language
> that have been stipulated to be true cannot possibly
> be undecidable is proven to be over-your-head on the
> basis that you have no actual reasoning as a rebuttal.
> 

No, all you have done is shown that you don't undertstand what you are 
talking about.

Godel PROVED that the FORMAL SYSTEM that his proof started in, is unable 
to PROVE that the statement G, being "that no Natural Number g, that 
satifies a particularly designed Primitive Recursive Relationship" is 
true, but also shows (using the Meta-Mathematics that derived the PRR 
for the original Formal System) that no such number can exist.

He does it by showing that that particular PRR can be derived, using the 
mathematics available in the original formal system, that when 
interpreted by the semantics added in the Meta-Mathematics, can be 
interpreted as a "Proof Checker" for a proof encoded by the rules of the 
meta-math, for the statement of G.

Thus, if a number exists that satisfies that PRR, it also produces a 
valid proof that no such number can exist, and thus since that would be 
a contradiction, and the stated assumption was that the original formal 
system was non-contradictory, so no such number can exist.

It also shows that no proof can be formed in the original Formal System, 
as any such proof could be encoded into a number, that would satisfy the 
PRR, and thus show the proof could not be valid, as the statement was false.

Your failure to understand this just shows your ignorance of the 
subject. Admittedly, this is somewhat complicated, so ignorance of it 
isn't that bad, but when you claim that the logic is wrong, and do so 
asserting things that are just not true, just shows that you are REALLY 
ignorant of what you talk about, and nothing but a pathological liar.

Sorry, YOU are the one over-your-head, but are too stupid to understand 
it, and seem to have drowned and killed off your mental ability.