Skip to main content
Log in

Decidability of the admissibility problem in layer-finite 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

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

Instant access to the full article PDF.

Literature cited

  1. Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  2. L. L. Maksimova, "Modal logics of finite layers," Algebra Logika,14, No. 3, 304–319 (1975).

    Google Scholar 

  3. L. L. Maksimova and V. V. Rybakov, "The lattice of normal modal logics," Algebra Logika,13, No. 2, 188–216 (1974).

    Google Scholar 

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

    Google Scholar 

  5. V. V. Rybakov, "Admissible rules for pretable modal logics," Algebra Logika,20, No. 4, 440–464 (1981).

    Google Scholar 

  6. A. I. Tsitkin, "Admissible rules for the intuitionistic predicate logic," Mat. Sb.,102, No. 2, 289–301 (1977).

    Google Scholar 

  7. T. Hosoi, "On intermediate logics. I", J. Fac. Sci. Univ. Tokyo,I, No. 14, 293–312 (1967).

    Google Scholar 

Download references

Authors

Additional information

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

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rybakov, V.V. Decidability of the admissibility problem in layer-finite logics. Algebra and Logic 23, 75–87 (1984). https://doi.org/10.1007/BF01979701

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation