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

Christophe Raffalli (LAMA); Karim Nour (LAMA)

arxiv: 0905.0758 · v1 · submitted 2009-05-06 · 🧮 math.LO

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

Karim Nour (LAMA) , Christophe Raffalli (LAMA) This is my paper

classification 🧮 math.LO

keywords logicclassicalcompletenessfirst-ordertheoremcasededuceextend

0 comments

read the original 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.

This paper has not been read by Pith yet.

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

discussion (0)