Re:Gödel and the limits of logic (2006)
by icen on Tuesday March 14, 2017 @06:22AM
(#13866333)
You can also give up recursive enumerability. `True Arithmetic`, which takes as axioms all of the true statements in PA is certainly complete and consistent.
[ Parent
| on HN ]
There are no comments on this comment yet.