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

Simple item page
dc.creatorNour, Karim
dc.creatorRaffalli, Christophe
dc.date2009-05-06
dc.date.accessioned2026-07-07T13:12:12Z
dc.date.available2026-07-07T13:12:12Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0905.0758
dc.identifierhttp://arxiv.org/abs/0905.0758
dc.identifierJournal of Theoretical Computer Science (TCS) 308 (2003) 227-237
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229513
dc.subjectLogic
dc.titleSimple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic
dc.typetext

Files

Collections

arXiv