It is not the case that If encoding-relative unprovability holds, proof complexity becomes undefined—we cannot meaningfully compare hardness across different representations.
?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.