Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic

Abstract

We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.