Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic
Logic
2009-05-07 v1
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.
Keywords
Cite
@article{arxiv.0905.0758,
title = {Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic},
author = {Karim Nour and Christophe Raffalli},
journal= {arXiv preprint arXiv:0905.0758},
year = {2009}
}