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

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

2009-05-06

arxiv.org/abs/0905.0758v1

Journal of Theoretical Computer Science (TCS) 308 (2003) 227-237

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple proof of the completeness theorem for second order classical and intuitionictic logic by reduction to first-order mono-sorted logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541493