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

Karim Nour (1) , Christophe Raffalli (1)

1 LAMA - Laboratoire de Mathématiques

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.

Domaines: Logique [math.LO]

Karim Nour, Christophe Raffalli. Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic. Theoretical Computer Science, 2003, 308, pp.227-237. ⟨hal-00381597⟩