Skip to main content
SpringerLink
Log in

Classification of derivable propositional formulas

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

Abstract

This article considers questions connected with the derivability of propositional formulas under restrictions on the length of the derivation. A classification is proposed for formulas with minimum derivation length.

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

Literature cited

  1. A. Church, Introduction to Mathematical Logic [Russian translation], Vol. 1, Moscow (1960).

  2. S. K. Klini, Introduction to Mathematics [in Russian], Moscow (1957).

  3. A. S. Anikeev, “On some classes of propositional formulas,” Proceedings of the All-Union Symposium on Mathematical Logic [in Russian], Alma-Ata (1969), pp. 4–5.

Download references

Author information

Authors and Affiliations

  1. M. V. Lomonosov Moscow State University, USSR

    A. S. Anikeev

Authors
  1. A. S. Anikeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 11, No. 2, pp. 165–174, February, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anikeev, A.S. Classification of derivable propositional formulas. Mathematical Notes of the Academy of Sciences of the USSR 11, 106–110 (1972). https://doi.org/10.1007/BF01097926

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation