Re: Peano Axioms anchored in First Grade Arithmetic on ASCII Digit String pairs

On 10/27/24 10:21 AM, olcott wrote:

On 10/27/2024 3:37 AM, Mikko wrote:

On 2024-10-26 13:17:52 +0000, olcott said:
>

Just imagine c functions that have enough memory to compute
sums and products of ASCII strings of digits using the same
method that people do.

>
Why just imagein? That is fairly easy to make. In some other lanugages
(e.g. Python, Javascript) it is alread in the library or as a built-in
feature.
>

 OK next I want to see the actual Godel numbers and the
arithmetic steps used to derive them.
 

Then do it. His proof detailed exactly how ot do it, he just didn't limit himself to Peano, as he wanted to prove it for ANY system that meet the minimum requirements.
Of course, the first requirement is to fully understand the Axioms of the system you want to use, and how that system derives its needed rules of arithmetic from those, at EVERY step in fine detail.
So, why don't you first make a listing of that, then do the encoding step.