On the proofs of arithmetical completeness of interpretability logic. The Notre Dame Journal of Formal Logic, 35:542{551 (1992)

by D Zambella
Venue:in his [41], that fP2 1 j GB > (ZF + P )g and fS2 1 j GB > (ZF + S)g