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

On 10/30/24 8:16 AM, olcott wrote:

On 10/30/2024 5:02 AM, Mikko wrote:

On 2024-10-27 14:21:25 +0000, olcott said:
>

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.

>
They can be found in any textbook of logic that discusses undecidability.
If you need to ask about details tell us which book you are using.
>

 Every single digit of the entire natural numbers
not any symbolic name for such a number.
 It might be the case that one number fills 100 books
of 1000 pages each.
 

But, before you can get those, you need to define the Meta-System you are building them in, as that changes the numbers.
So, if you want to see a sample set of the numbers, do the work to get them.