It is not the case that If unprovability were encoding-independent, a single lower bound would apply universally—but no such bound exists across all formalizations.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.