Skip to main content
SpringerLink
Log in

Cut-elimination theorem for relevant logics

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

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

Literature cited

  1. A. R. Anderson, “Some open problems concerning the systemE of entailment,” Acta Phil. Fennica,16, 7–18 (1963).

    Google Scholar 

  2. A. R. Anderson and N. D. Belnap, “The pure calculus of entailment,” J. Symbolic Logic,27, No. 1, 19–52 (1962).

    Google Scholar 

  3. N. D. Belnap, “Intensional models for first-degree formulas,” J. Symbolic Logic,32, No. 1, 1–22 (1967).

    Google Scholar 

  4. D. Prawitz, Natural Deduction, Stockholm (1965).

  5. G. Kreisel, “A survey of proof theory (II),” in: Proc. Second Scand. Logic Sympos. (1971), pp. 109–170.

  6. N. D. Belnap and J. R. Wallace, “A decision procedure for the systemE ¯J of entailment with negation,” Z. Math. Logik Grundlagen. Math.,11, No. 4, 277–289 (1965).

    Google Scholar 

Download references

Authors
  1. G. E. Mints
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im V. A. Steklova Akademii Nauk SSSR, Vol. 32, pp. 90–97, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mints, G.E. Cut-elimination theorem for relevant logics. J Math Sci 6, 422–428 (1976). https://doi.org/10.1007/BF01084083

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01084083

Keywords

Search

Navigation