Labeled Natural Deduction Systems for a Family of Tense Logics

Details Labeled Natural Deduction Systems for a Family of Tense Logics Labeled Natural Deduction Systems for a Family of Tense Logics

2008-03-21

arxiv.org/abs/0803.3187v2

Computer Science

Logic in Computer Science

Scientific paper

We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of useful normalization properties (in particular, derivations reduce to a normal form that enjoys a subformula property). We also discuss how to extend our systems to capture richer logics like (fragments of) LTL.

Affiliated with

Also associated with

No associations

Rating

Labeled Natural Deduction Systems for a Family of Tense Logics 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 Labeled Natural Deduction Systems for a Family of Tense Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Labeled Natural Deduction Systems for a Family of Tense Logics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-587457