No label defined (Q3972527)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 15881
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 15881

      Statements

      25 June 1992
      0 references
      resolution rule
      0 references
      propositional logics
      0 references
      resolution-type calculus
      0 references
      intuitionistic logic
      0 references
      modal logic
      0 references
      clause normal form
      0 references
      completeness
      0 references
      extension of Maslov's method
      0 references
      0 references
      [For the entire collection see Zbl 0709.00021.] A resolution-type calculus is defined for propositional systems for which cut-free Gentzen formulations with the subformula property are known. These include intuitionistic logic and modal logic \(S4,S5,T,K4\) and \(K\). The basic idea is to generate a clause normal form by replacing complex subformulae in the skope of modal operators by new propositional variables. These new variables are axiomatized by declaring them equivalent with the replaced subformula. With this trick, for example all modal formulae can be put into a form with modal degree one, what greatly simplifies the calculus. The method is formalized and a completeness proof is given. Moreover, it is seen as a general method for transforming a cut-free Gentzen-type propositional system into a resolution-type system preserving the structure of derivations. This is a direct extension of Maslov's method for classical predicate logic. An implementation of the method is mentioned.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references