The search session has expired. Please query the service again.
In this paper we present a very general deduction theorem which -based upon a uniform notion of proof from hypotheses- holds for a very large class of logical systems. Most of the known results for classical and modal logics, as well as new results, are immediate corollaries of this theorem.
In this paper a semantical partition, relative to Kripke models, is introduced for sets of formulas. Secondly, this partition is used to generate a semantical hierarchy for modal formulas. In particular some results are given for the propositional calculi T and S4.
Download Results (CSV)