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

Groups > sci.logic > #339825

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

Cross-posted to 2 groups.

Show all headers | View raw

On 5/5/2025 8:11 PM, Richard Damon wrote:
> On 5/5/25 11:31 AM, olcott wrote:
>> On 5/5/2025 6:04 AM, 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.
>>>
>>
>> It seems to me that the inferences steps that could
>> otherwise create undecidability cannot exist in the
>> system that I propose.'
> 
> Only because it seems to create a trivially small system.
> 

When I told you that the system comprises the entire
set of all general knowledge that can be expressed in
language many many times, you must have a mental defect
to to think that this system is very small.

>>
>> For example: "This sentence is not true" cannot be
>> derived by applying semantic logical entailment to
>> basic facts. It is rejected as semantically unsound
>> on this basis.
> 
> So?
> 
>>
>> Try to show any complete concrete example using
>> a system of basic facts and applying semantic logical
>> entailment where undecidability can be derived.
> 
> That isn't what I said. I said that you system, to be decidable, 
> couldn't include the mathematics of the Natural Numbers.
> 

It does includes the mathematics of natural numbers
expressed as basic facts and truth preserving
operations applied to these basic facts.

When you start with truth and only apply truth
preserving operations you necessarily only end
up with truth. This means that you NEVER end
up with any undecidability.

The Liar Paradox: "this sentence is not true"
is rejected as untrue because it cannot be derived
by applying only truth preserving operations to
basic facts.

-- 
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

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