Part 5: Automatic ReasoningInternational audienceAn axiomatic system is presented in this paper, which has a modal operator □ such that $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$, where □1 and □2 are the modal operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete
Part 5: Automatic ReasoningInternational audienceThe propositional modal logic is obtained by adding the necessity operator □ to the propositional logic. Each formula in the propositional logic is equivalent to a formula in the disjunctive normal form. In order to obtain the correspondence between the propositional modal logic and the propositional logic, we add the axiom $\Box\varphi \leftrightarrow\Diamond\varphi $ to K and get a new system K + . Each formula in such a logic is equivalent to a formula in the disjunctive normal form, where □k(k ≥ 0) only occurs before an atomic formula p, and $\lnot$ only occurs before a pseudo-atomic formula of form □k p. Maximally consistent sets of K + have a property holding in the propositional logic: a set of pseudo-atom-complete formulas uniquely determines a maximally consistent set. When a pseudo-atomic formula □k pi (k,i ≥ 0) is corresponding to a propositional variable qki, each formula in K + then can be corresponding to a formula in the propositional logic P + . We can also get the correspondence of models between K + and P + . Then we get correspondences of theorems and valid formulas between them. So, the soundness theorem and the completeness theorem of K + follow directly from those of P +
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.