Classical provability of uniform versions and intuitionistic provability

Along the line of Hirst-Mummert and Dorais , we analyze the relationship between the classical provability of uniform versions Uni(S) of Π₂-statements S with respect to higher order reverse mathematics and the intuitionistic provability of S. Our main theorem states that (in particular) for every Π₂-statement S of some syntactical form, if its uniform version derives the uniform variant of ACA over a classical system of arithmetic in all finite types with weak extensionality, then S is not provable in strong semi-intuitionistic systems including bar induction BI in all finite types but also nonconstructive principles such as Konig's lemma KL and uniform weak Konig's lemma UWKL. Our result is applicable to many mathematical principles whose sequential versions imply ACA.