Re: How a True(X) predicate can be defined for the set of analytic knowledge

On 4/3/2025 6:06 AM, Richard Damon wrote:

On 4/3/25 12:27 AM, olcott wrote:

On 4/2/2025 10:09 PM, Richard Damon wrote:

On 4/2/25 10:51 PM, olcott wrote:

On 4/2/2025 8:56 PM, Richard Damon wrote:

On 4/2/25 9:30 PM, olcott wrote:

On 4/2/2025 5:05 PM, Richard Damon wrote:

On 4/2/25 11:59 AM, olcott wrote:

On 4/2/2025 4:20 AM, Mikko wrote:

On 2025-04-01 17:51:29 +0000, olcott said:
>

>
All we have to do is make a C program that does this
with pairs of finite strings then it becomes self-evidently
correct needing no proof.

>
There already are programs that check proofs. But you can make your own
if you think the logic used by the existing ones is not correct.
>
If the your logic system is sufficiently weak there may also be a way to
make a C program that can construct the proof or determine that there is
none.
>

>
When we define a system that cannot possibly be inconsistent
then a proof of consistency not needed.

>
But you can't do that unless you limit the system to only have a finite number of statements expressible in it, and thus it can't handle most real problems
>

>
A system entirely comprised of Basic Facts and Semantic logical entailment cannot possibly be inconsistent.
>

>
Sure it can.
>
The problem is you need to be very careful about what you allow as your "Basic Facts", and if you allow the system to create the concept of the Natural Numbers, you can't verify that you don't actually have a contradition in it.
>

>
It never has been that natural numbers have
ever actually had any inconsistency themselves
they are essentially nothing more than an ordered
set of finite strings of digits.

>
No, but any logic system that can support them

>
Can be defined in screwy that has undecidability
or not defined in this screwy way.
>
Basic facts and expressions semantically entailed
by the basic facts cannot have undecidability[math].
>

>
Wrong, Godel shows that having the properties of the Natural numbers is enough.
>

>
They are merely an ordered set of finite strings of digits.

 No, the Natural Numbers are NOT "finite strings" but that is just a representation for them, and a given number can have many representations.
 And they are just an ordered set, but there are a number of semantic properties of the members. Things like 2 + 3 is 5, and 2 * 3 is 6, and that some numbers are called "prime" because the only way to decompose them with multiplication is themselves times one, but other numbers can be decomposed as the product of other numbers, and the set of prime numbers (with their powers) has a one to one relationship to the set of numbers, every product set resulting in just a single number and every number having just a single product set.
  From this, and the fact that a logic system that can support these concepts WILL have a statement in it that is true and unprovable in the system.
 

Natural numbers are merely an ordered set of concepts
that are associated with some form of encoding. Even
arithmetic is added on top of the notion of natural
numbers.
A simple algorithm can specify the operations required
to find the sum of pairs of strings of numeric digits.
This much cannot possibly result in undecidability or
incompleteness.
(a) Any consistent set of axioms that are stipulated to be true.
(b) Semantic logical entailment from these axioms
Cannot possibly have any undecidability.
This remains true when the formal language is as
expressive as natural language (such as English).
It also remains true for the entire body of
knowledge that can be expressed in language.

>

Show what property he uses that you can withhold and still have a reasonably usable mathematics.
>
Your problem is you don't understand the power that basic logic gets from the basic nature of the Natural Numbers.

>
>

 

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