| Deutsch English Français Italiano |
|
<7f7cddff0f7ca4f20a0281b6b87a10ba62a9ab83@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 20:17:11 -0500 Organization: i2pn2 (i2pn.org) Message-ID: <7f7cddff0f7ca4f20a0281b6b87a10ba62a9ab83@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> <8c2cbbe343934d211ad8c820c963702e70351a27@i2pn2.org> <vglk31$3a6hn$1@dont-email.me> <19d0838dd000cc4f67c8c64ac6005d5405cf2bd6@i2pn2.org> <vglv58$3bn2s$3@dont-email.me> <cd6cbe7d70fcc282da94aea2107e48ad4b3f44b5@i2pn2.org> <vgm79v$3d9gu$1@dont-email.me> <4b24331953934da921cb7547b6ee2058ac9e7254@i2pn2.org> <vgmb06$3e37h$1@dont-email.me> <0f50fdae7fc0575c50ab58e32f686f8e8c8af140@i2pn2.org> <vgmcdp$3e8gf$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Sat, 9 Nov 2024 01:17:11 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="1602078"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird In-Reply-To: <vgmcdp$3e8gf$1@dont-email.me> X-Spam-Checker-Version: SpamAssassin 4.0.0 Content-Language: en-US Bytes: 5904 Lines: 106 On 11/8/24 8:03 PM, olcott wrote: > On 11/8/2024 6:58 PM, Richard Damon wrote: >> On 11/8/24 7:39 PM, olcott wrote: >>> On 11/8/2024 6:33 PM, Richard Damon wrote: >>>> On 11/8/24 6:36 PM, olcott wrote: >>>>> On 11/8/2024 3:59 PM, Richard Damon wrote: >>>>>> On 11/8/24 4:17 PM, olcott wrote: >>>>>>> On 11/8/2024 12:31 PM, Richard Damon wrote: >>>>>>>> On 11/8/24 1:08 PM, olcott wrote: >>>>>>>>> On 11/8/2024 12:02 PM, Richard Damon wrote: >>>>>>>>>> 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. >>>>>>>>>> >>>>>>>>> >>>>>>>>> The equivocation of switching formal systems from PA to meta-math. >>>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> No, it just shows you don't understand how meta-systems work. >>>>>>>> >>>>>>> >>>>>>> IT SHOWS THAT I KNOW IT IS STUPID TO >>>>>>> CONSTRUE TRUE IN META-MATH AS TRUE IN PA. >>>>>>> THAT YOU DON'T UNDERSTAND THIS IS STUPID IS YOUR ERROR. >>>>>> >>>>>> But, as I pointed out, the way Meta-Math is derived from PA, >>>>> >>>>> Meta-math <IS NOT> PA. >>>>> Meta-math <IS NOT> PA. >>>>> Meta-math <IS NOT> PA. >>>>> Meta-math <IS NOT> PA. >>>>> >>>>> True in meta-math <IS NOT> True in PA. >>>>> True in meta-math <IS NOT> True in PA. >>>>> True in meta-math <IS NOT> True in PA. >>>>> True in meta-math <IS NOT> True in PA. >>>>> >>>>> This sentence is not true: "This sentence is not true" >>>>> is only true because the inner sentence is bullshit gibberish. >>>>> >>>>> >>>> >>>> But MM has exactly the same axioms and rules as PA, so anything >>>> established by that set of axioms and rules in MM is established in >>>> PA too. >>>> >>>> There are additional axioms in MM, but the rules are built specifically >>> >>> One single level of indirect reference CHANGES EVERYTHING. >>> PA speaks PA. Meta-math speaks ABOUT PA. >>> >>> The liar paradox is nonsense gibberish except when applied >>> to itself, then it becomes true. >>> >> >> No, Meta-Math speaks PA, because is includes ALL the axioms and rules >> of PA, so it can speak PA. >> >> You just don't understand what a meta-system is. >> > > In C we can have a pointer to a character string > and a pointer to a pointer to a character string. > But we are not talking about C. > The pointer to pointer is one level of indirect > reference away form the pointer to the character string. But the meta-math is not restricted to nust talking about PA, it can talk in the language of PA. > > I know exactly what a meta-system is. It is a system that > refers to the underlying system by one level of indirect > reference. PA talks PA meta-math talks ABOUT PA. > Nope, you THINK you know about what a meta-system is, but you don't. You are using a definition from another context which isn't applicable. The "meta" systems, are system that FULLY INHERET the base system, and then ADD information about that system, in a way they can still talk the original language. Sorry, you are just proving your ignorance. Read the papers and where they talk about how the meta-systems are built.