Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > sci.logic > #339816

Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable

Cross-posted to 2 groups.

Show all headers | View raw

On Mon, 05 May 2025 07:04:15 -0400, Richard Damon wrote:

> On 5/4/25 10:23 PM, olcott wrote:
>> When we define formal systems as a finite list of basic facts and allow
>> semantic logical entailment as the only rule of inference we have
>> systems that can express any truth that can be expressed in language.
>> 
>> Also with such systems Undecidability is impossible. The only
>> incompleteness are things that are unknown or unknowable.
> 
> Can such a system include the mathematics of the natural numbers?
> 
> If so, your claim is false, as that is enough to create that
> undeciability.
> 
> 
>> The language of such a formal system is an extended form of the
>> Montague Grammar of natural language semantics. I came up with this
>> mostly in the last two years. I have been working on it for 22 years.
>> 
>> The Montague Grammar Rudolf Carnap Meaning postulates are organized in
>> a knowledge ontology inheritance hierarchy.
>> https://en.wikipedia.org/wiki/
>> Ontology_(information_science)
> 
> And the problem is that either your claim is wrong, or your logic system
> is just shown to be too small to be useful for many of the things we
> want to be able to do because it can't support the mathematics of
> Natural Numbers.
> 
> You don't seem to understand that all the properties you don't like
> about Logic Systems are all conditioned on the ability for the system to
> have a certain level of power in their ability to do logic. "Tpy"
> systems that have been limited below that level will not experiance the
> problems, but also are too weak to do the problems we typically want to
> do with logic.
> 
> This ultimate shows your fundamental misunderstanding of what you are
> talking about, especially your inability to handle abstractions, and
> things that can create "infinities".

You are fucking clueless about mathematics it seems: it is not possible to 
create infinites using the mathematics of natural numbers (clue: division 
by zero is undefined and infinity is not a number).

/Flibble

Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Formal systems that cannot possibly be incomplete except for unknowns and unknowable olcott <polcott333@gmail.com> - 2025-05-04 21:23 -0500
  Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Mikko <mikko.levanto@iki.fi> - 2025-05-05 12:50 +0300
    Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable olcott <polcott333@gmail.com> - 2025-05-05 10:39 -0500
      Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Mikko <mikko.levanto@iki.fi> - 2025-05-06 13:02 +0300
  Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Alan Mackenzie <acm@muc.de> - 2025-05-05 10:47 +0000
    Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable olcott <polcott333@gmail.com> - 2025-05-05 16:03 -0500
      Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Alan Mackenzie <acm@muc.de> - 2025-05-06 08:30 +0000
        Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Mikko <mikko.levanto@iki.fi> - 2025-05-06 13:04 +0300
  Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Richard Damon <richard@damon-family.org> - 2025-05-05 07:04 -0400
    Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Mr Flibble <flibble@red-dwarf.jmc.corp> - 2025-05-05 14:46 +0000
      Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Richard Heathfield <rjh@cpax.org.uk> - 2025-05-05 16:51 +0100
        Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Mr Flibble <flibble@red-dwarf.jmc.corp> - 2025-05-05 16:10 +0000
          Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Richard Heathfield <rjh@cpax.org.uk> - 2025-05-05 17:59 +0100
      Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Richard Damon <richard@damon-family.org> - 2025-05-05 21:08 -0400
    Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable olcott <polcott333@gmail.com> - 2025-05-05 10:31 -0500
      Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Richard Damon <richard@damon-family.org> - 2025-05-05 21:11 -0400
        Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable olcott <polcott333@gmail.com> - 2025-05-05 21:26 -0500
          Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Richard Damon <richard@damon-family.org> - 2025-05-06 07:16 -0400
      Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable olcott <polcott333@gmail.com> - 2025-05-05 23:27 -0500
        Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Alan Mackenzie <acm@muc.de> - 2025-05-06 08:17 +0000
        Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Richard Damon <richard@damon-family.org> - 2025-05-06 07:20 -0400
          Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable ---ELABORATED olcott <polcott333@gmail.com> - 2025-05-06 12:46 -0500
            Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable ---ELABORATED Richard Damon <richard@damon-family.org> - 2025-05-06 22:07 -0400
  Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 16:24 +0000
    Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable olcott <polcott333@gmail.com> - 2025-11-15 10:55 -0600
      Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 17:30 +0000
        Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable olcott <polcott333@gmail.com> - 2025-11-15 11:43 -0600
  Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 16:49 +0000
    Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable olcott <polcott333@gmail.com> - 2025-11-15 11:19 -0600
  Re: Kaz ---Keith said DDD simulated by HHH is equivalent to DDD calling itself olcott <polcott333@gmail.com> - 2025-11-16 09:29 -0600
    Re: Kaz ---Keith said DDD simulated by HHH is equivalent to DDD calling itself HAL 9000 <hal@discovery.nasa> - 2025-11-16 16:46 +0000
      Re: Kaz ---Keith said DDD simulated by HHH is equivalent to DDD calling itself olcott <polcott333@gmail.com> - 2025-11-16 11:07 -0600
      DD simulated by HHH cannot possibly terminate normally olcott <polcott333@gmail.com> - 2025-11-16 11:20 -0600
      Re: Kaz ---Keith said DDD simulated by HHH is equivalent to DDD calling itself "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-16 13:18 -0800

csiph-web