Claudio Cerrato

Learn More
A b s t r a c t. We prove decidability for all of the main graded normal logics, by a notion of filtration suitably conceived for this environment. 1. I n t r o d u c t i o n Graded normal logics (G N L s) are the extensions of modal normal logics to a language with graded modalities. The interpretation in usual Kripke models of a formula <>hA (n < w),(More)
  • 1