Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic
Résumé
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]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...