It is not the case that A proof system is polynomially bounded only if all tautologies of size n possess proofs of size at most p(n) for some polynomial p
?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.