A Computational Interpretation of Modal Proofs

@inproceedings{Martini1994ACI,
  title={A Computational Interpretation of Modal Proofs},
  author={Simone Martini and Andrea Masini},
  year={1994}
}
The usual (e.g. Prawitz's) treatment of natural deduction for modal logics involves a complicated rule for the introduction of the necessity, since the naive one does not allow nor-malization. We propose natural deduction systems for the positive fragments of the modal logics K, K4, KT, and S4, extending previous work by Masini on a two-dimensional generalization of Gentzen's sequents (2-sequents). The modal rules closely match the standard rules for an universal quantiier and diierent logics… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Selected Papers in Proof Theory

  • Grigori Mints
  • Bibliopolis,
  • 1992

Proof Theory and Logical Complexity

  • Jean-Yves Girard
  • Bibliopolis,
  • 1987
1 Excerpt

Similar Papers

Loading similar papers…