For adequate arithmetic provability predicates, the arithmetized deduction theorem identifies inconsistency of with -provability of . Formalized second incompleteness gives . Contraposition yields the displayed conditional. This is an internal theorem and does not license removal of its consistency premise.
Articles by others on the same topic
There are currently no matching articles.