Skip to main content
SpringerLink
Log in

Number of prelocally table superintuitionistic propositional logics

  • Published:
Algebra and Logic Aims and scope

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. L. L. Maksimova, "On locally finite varieties of pseudo-Boolean algebras," 16th All-Union Conf. on Algebra, Leningrad (1981), pp. 99–100.

  2. A. I. Mal'tsev, Algebraic Systems [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  3. E. Raseva and R. Sikorskii, The Mathematics of Metamathematics [in Russian], Nauka, Moscow (1972).

    Google Scholar 

  4. A. I. Tsitkin, "An example of a prelocally table superinuitionistic propositional logic," in: Logic and the Foundations of Mathematics [in Russian], Vilnius (1982), pp. 97–99.

  5. K. Jacobs, "Machine-generated 0–1-sequences", in: Turing Machines and Recursive Functions [Russian translation], Mir, Moscow (1972).

    Google Scholar 

  6. V. A. Yankov, "The connection between deducibility in an intuitionistic propositional calculus, and finite implication structures", Dokl. Akad. Nauk SSSR,151, No. 6, 1263–1264 (1963).

    Google Scholar 

Download references

Authors
  1. S. I. Mardaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 23, No. 1, pp. 74–87, January–February, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mardaev, S.I. Number of prelocally table superintuitionistic propositional logics. Algebra and Logic 23, 56–66 (1984). https://doi.org/10.1007/BF01979699

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation