Skip to main content
SpringerLink
Log in

Indexed systems of sequents and cut-elimination

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

Abstract

Cut reductions are defined for a Kripke-style formulation of modal logic in terms of indexed systems of sequents. A detailed proof of the normalization (cut-elimination) theorem is given. The proof is uniform for the propositional modal systems with all combinations of reflexivity, symmetry and transitivity for the accessibility relation. Some new transformations of derivations (compared to standard sequent formulations) are needed, and some additional properties are to be checked. The display formulations of the systems considered can be presented as encodings of Kripke-style formulations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Belnap, N. (1982): Display logic, Journal of Philosophical Logic 11: 375–417.

    Google Scholar 

  2. Gentzen, G. (1934): Untersuchungen über das logische Schliessen. Mathematische Zeitschrift 39: 176–210, 405–431.

    Google Scholar 

  3. Fitting, M. (1983): Proof Methods for Modal and Intuitionistic Logics, D. Reidel, Dordrecht.

    Google Scholar 

  4. Kleene, S. C. (1952): Introduction to Metamathematics, Amsterdam, North-Holland.

  5. Kleene, S. C. (1952): Two papers on the predicate calculus, Memoirs of the American Mathematical Society 10: 1–66.

    Google Scholar 

  6. Kripke, S. (1963): Semantical analysis of modal logic I, Zeitschr. f. math. Logik und Grundl. d. Mathematik 9: 67–96.

    Google Scholar 

  7. Kripke, S. (1965): Semantical analysis of intuitionistic logic I. In: Formal Systems and Recursive Functions, North-Holland, Amsterdam, pp. 92–130.

  8. Hughes, G. and Kresswell, M. (1972): An Introduction to Modal Logic, Methuen, The Hague.

  9. Mints, G. (1992): A Short Introduction to Modal Logic. Center for the Study of Language and Information, Stanford, 91 p.

  10. Mints, G. (1992): Selected Papers in Proof Theory, Bibliopolis, Napoli, Italia and North-Holland, Amsterdam.

  11. Mints, G. (1971): On some calculi of modal logic. Proc. Steklov Inst. of Mathematics 98: 97–122.

    Google Scholar 

  12. Mints, G. (1992): Lewis systems and the system T. In: Mints, G. Selected Papers in Proof Theory. North-Holland-Bibliopolis, pp. 221–294 (Russian Original 1974).

  13. Mints, G. (1983): Review of Belnap 1982. Referativnyi Zhurnal Matematika, 5A64.

  14. Ohlbach, H. (1991): Semantic-based translation methods for modal logics, J. Logic and Computation 1(5): 691–746.

    Google Scholar 

  15. Wallen, L. (1990): Automated Deduction in Non-classical Logics, MIT Press, Cambridge, Mass.

    Google Scholar 

  16. Wansing, H. (1994): Modal calculi for normal modal propositional logics, J. Logic and Computation 4(2): 125–142.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, Stanford University, Stanford, Ca, 94305-2155, U.S.A

    Grigori Mints

Authors
  1. Grigori Mints
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mints, G. Indexed systems of sequents and cut-elimination. Journal of Philosophical Logic 26, 671–696 (1997). https://doi.org/10.1023/A:1017948105274

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1017948105274

Keywords

Search

Navigation