3 ms·
Your second paragraph is just a direct begging-of-the-question. More significantly, verifying that sentences are well-formed in some language is not the same a
by mannykannot 7y ago
Your second paragraph is just a direct begging-of-the-question.
More significantly, verifying that sentences are well-formed in some language is not the same as proving the language’s correctness.
As a response to you argument, consider this regular language:
A
- dang 7y agoPlease also stop.
- ukj 7y agoCurry-Howard isomorphism. Proving that a sentences are “well-formed” is the same as implementing an algorithm which takes a string and returns a Boolean. You can call this function “is_well_formed?” I await your proof in the regular language you have specified above.