It is not the case that Σ^B₁-definability is a syntactic criterion, but polynomial-time computability is an extensional, machine-relative notion—Benacerraf's identification problem applies here.
?Set your confidence on the premises below to see your aggregate.