Abstract

We obtain the upper bound for the number of applications of rules in the deduction tree of modal formulas in some variants of the S4 calculus. We use this estimate to construct the calculus where the only derivable formulas are those whose counterparts in S4 are unprovable.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call