ArisKatsaris comments on Logical Pinpointing - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (338)
Surely the set of finite strings in an alphabet of no-matter-how-many-symbols satisfies the Peano axioms? e.g. using the English alphabet (with A=0, B=S(A), C=S(B)....AA=S(Z), AB=S(AA), etc would make a base-26 system).
Single symbol alphabet is more interesting, (empty string = 0, sucessor function = append another symbol) the system you describe is more succinctly described using a concatenation operator:
From these definitions we get, example-wise: