A semantical proof of the strong normalization theorem for full propositional classical natural deduction

Details A semantical proof of the strong normalization theorem for full propositional classical natural deduction A semantical proof of the strong normalization theorem for full propositional classical natural deduction

2009-05-04

arxiv.org/abs/0905.0358v1

Archive for Mathematical Logic 45, 3 (2006) 357-364

Mathematics

Logic

Scientific paper

We give in this paper a short semantical proof of the strong normalization
for full propositional classical natural deduction. This proof is an adaptation
of reducibility candidates introduced by J.-Y. Girard and simplified to the
classical case by M. Parigot.

Affiliated with

Also associated with

No associations

Rating

A semantical proof of the strong normalization theorem for full propositional classical natural deduction 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 A semantical proof of the strong normalization theorem for full propositional classical natural deduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A semantical proof of the strong normalization theorem for full propositional classical natural deduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-199409