You can also give up recursive enumerability. `True Arithmetic`, which takes as ...

icen on March 14, 2017 | parent | context | favorite | on: Gödel and the limits of logic (2006)

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.