For the standard Gödel sentence and Rosser sentence, the formalized Rosser unprovability theorem and yield . If is consistent, the converse is unprovable under the usual formalized incompleteness hypotheses. A proof of would give . Formalized negative unprovability identifies with and with . The strengthened theory would then prove its own consistency, contradicting the Gödel second incompleteness theorem. The consistency assumption belongs to this strictness conclusion.

Articles by others on the same topic (0)

There are currently no matching articles.