Skip to main content
Log in

Decidable modal logic with undecidable admissibility problem

  • 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. V. V. Rybakov, "Problems of admissibility and substitution, logical equations and restricted theories of free algebras," in: Logic, Methodology and Philosophy of Science VIII, Elsevier (1989), pp. 121–139.

  2. V. V. Rybakov, "On admissibility of inference rules in modal logicG," Tr. Inst. Mat. Sib. Otd. Akad. Nauk SSSR,12, 120–138, (1989).

    Google Scholar 

  3. V. V. Rybakov, "Equations in free closure algebras and the substitution problem," Dokl. Akad. Nauk SSSR,287, No. 3, 554–557 (1986).

    Google Scholar 

  4. G. D. Birkhoff, Lattice Theory, Amer. Math. Soc. (1979).

  5. K. Fine, "Logics containing K4, Part I," J. Symb. Logic,39, No. 1, 31–42 (1974).

    Google Scholar 

  6. A. I. Mal'tsev, "Identical relations on quasigroup varieties," Mat. Sb.,69, No. 1, 3–12 (1966).

    Google Scholar 

Download references

Authors

Additional information

Translated from Algebra i Logika, Vol. 31, No. 1, pp. 83–93, January–February, 1992.

Translated by L. Smolina

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chagrov, A.V. Decidable modal logic with undecidable admissibility problem. Algebr Logic 31, 53–61 (1992). https://doi.org/10.1007/BF02259858

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation