Re:Kurt Gödel and the romance of logic
by infinity0 on Tuesday December 25, 2018 @07:08AM
(#18757121)
> You are using the word “truth” but it is more correct to use provable/non-provable.
I used both the words "truth" and "provable" in the correct and appropriate ways. Both are distinct concepts that form an important part of the theory.
It’s important that we are talking about models of the first order Peano Axioms. One can always find a system of axioms in which all true statements are provable. To do this just take the collection of all true statements in the standard model. Now every true statement is a theorem. It’s easy to have a complete set of axioms. What can’t happen is a recursively enumerable set of axioms that is complete and consistent.
Recursively enumerability is needed so that one can have an effective means of determining if a statement is an axiom. Think computable when I say effective.
When talking about truth we need to be careful because this is tied to a model of an axiomatic system. By the Completeness Theorem a statement that is true in all models of the system is provable.