I am interested in knowing what the weakest systems are that can prove basic meta-logical theorems. For instance, I would like to know whether Peano Arithmetic can prove soundness and completeness for first order predicate calculus. Can anyone either state such results or direct me to the relevant literature? Paul Studtmann