A Duplication and Loop Checking Free Proof System for S 4

@inproceedings{Governatori1996ADA,
  title={A Duplication and Loop Checking Free Proof System for S 4},
  author={Guido Governatori},
  year={1996}
}
Most of the sequent/tableau based proof systems for the modal logic S4 need to duplicate formulas and thus are required to adopt some method of loop checking [7, 13, 10]. In what follows we present a tableau-like proof system for S4, based on D’Agostino and Mondadori’s classical KE [3], which is free of duplication and loop checking. The key feature of this system (let us call it KES4) consists in its use of (i) a label formalism which models the semantics of the modal operators according to… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Uniform vs not uniform strategies in modal tableaux

  • Stephane Demri
  • Journal of Applied and Non Classical Logic,
  • 1995
2 Excerpts

and Mario Ornaghi Refutation systems for propositional modal logics

  • Pierangelo Migliogli, Ugo Moscato
  • Theorem proving with analytic tableaux and…
  • 1995

How to avoid duplications in refutation systems for intuitionistic and Kuroda logic

  • Pierangelo Migliogli, Ugo Moscato, Mario Ornaghi
  • eds. Tableaux 94,
  • 1994
1 Excerpt

On a contraction free sequent calculus for the modal logic S4

  • Jörg Hudelmaier
  • eds. Tableaux 94,
  • 1994
1 Excerpt

Girle . Nonlooping tableau for S 4

  • A. Roderic
  • 1993

Non-looping tableau for S4

  • Roderic A. Girle
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…