It is not the case that Buss and Cook's work on bounded arithmetic reveals that the metatheoretic reasoning validating transitivity of reductions may itself require proof-theoretic resources exceeding those formalizable in weak systems.
?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.