An Infinitary Graded Modal Logic (Graded Modalities VI)
Maurizio Fattorosi‐Barnaba, Silvano Grassotti · Mathematical logic quarterly · 1995
Abstract We prove a completeness theorem for K , the infinitary extension of the graded version K0 of the minimal normal logic K, allowing conjunctions and disjunctions of countable sets of formulas. This goal is achieved using both the usual tools of the normal logics with graded modalities and the machinery of the predicate infinitary logics in a version adapted to modal logic.