It is not the case that Whether NP-completeness proofs are themselves formalizable without presupposing consistency of strong arithmetical systems is an open foundational question (cf. Krajíček 1995).
?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.