Skip to main content
SpringerLink
Log in

Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

The main result of this paper is the following theorem: each modal logic extendingK4 having the branching property belowm and the effective m-drop point property is decidable with respect to admissibility. A similar result is obtained for intermediate intuitionistic logics with the branching property belowm and the strong effective m-drop point property. Thus, general algorithmic criteria which allow to recognize the admissibility of inference rules for modal and intermediate logics of the above kind are found. These criteria are applicable to most modal logics for which decidability with respect to admissibility is known and to many others, for instance, to the modal logicsK4,K4.1,K4.2,K4.3,S4.1,S4.2,GL.2; to all smallest and greatest counterparts of intermediate Gabbay-De-Jong logicsD n; to all intermediate Gabbay-De-Jong logicsD n; to all finitely axiomatizable modal and intermediate logics of finite depth etc. Semantic criteria for recognizing admissibility for these logics are offered as well.

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

References

  1. F. Bellissima,Finitely generated free Heyting algebras Journal of Symbolic Logic (JSL), Vol.51 (1986), No. 1, pp. 152–165.

    Google Scholar 

  2. W. J. Blok andD. Pigozzi,Algebraizable logic, Memoirs of the Amer. Math, Soc., v. 77, No 396, 1989.

  3. R. Fagin, J. Y. Halpern andM. Y. Vardi,What is an inference rule Journal of Symbolic Logic,57(1992), No 3, pp. 1018 -1045.

    Google Scholar 

  4. K. Fine,Logics containing K4, Part I Journal of Symbolic Logic,39(1974), pp. 229–237.

    Google Scholar 

  5. D. M. Gabbay andH. J. De Jong,A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property Journal of Symbolic Logic,39(1974), No 1, pp. 67–78.

    Google Scholar 

  6. R. I. Goldblatt,Metamathematics of modal logics Reports on Mathematical Logic, Vol.6(1976), pp. 41–78 (Part 1),7(1976), pp. 21 – 52 (Part 2).

    Google Scholar 

  7. D. H. de Jong andA. S. Troelstra,On the connection of partially ordered sets with some pseudo-Boolean algebras Indagationed Mathematicae,28 (1966), pp. 317–329.

    Google Scholar 

  8. M. Kracht,Internal definability and completeness in modal logic, Ph. D., Thesis, Free University Berlin, 1990.

  9. L. L. Maksimova andV. V. Rybakov,A lattice of normal modal logics Algebra and Logic, V.13 (1974), No.2, pp. 105–122.

    Google Scholar 

  10. W. Rautenberg,Klassische und nichtklassische Aussagenlogik, Braunschweig/Wiesbaden, 1979.

  11. V. V. Rybakov,Admissible rules of pretabular modal logics Algebra and Logic, V.20 (1981), pp. 291–307 (English translation).

    Google Scholar 

  12. V. V. Rybakov,A criterion for admissibility of rules in the modal system S4and the intuitionistic logic, Algebra and Logic, V.23 (1984), No. 5, pp. 369–384 (English translation).

    Google Scholar 

  13. V. V. Rybakov,Admissible rules for logic containing S4.3, Sibirsky Math. Journal, V.25(1984), No 5, pp. 141 – 145 (in Russian), English transl. inSiberian Math. Journal, 1984.

  14. V. V. Rybakov,The bases for admissible rules of logics S4 and Int Algebra and Logic, V.24(1985), pp. 55–68 (English translation).

    Google Scholar 

  15. V. V. Rybakov,Bases of admissible rules of the modal system Grz and of intuitionistic logic Math USSR Sbornic, Vol.56(1987), No. 2, 311–331.

    Google Scholar 

  16. V. V. Rybakov,Problems of admissibility and substitution, logical equations and restricted theories of free algebras Proced. of the 8-th International. Congress of Logic Method. and Phil. of Science. Elsevier Sci. Publ., North. Holland, Amsterdam, pp. 1989, 121–139.

    Google Scholar 

  17. V. V. Rybakov,Problems of substitution and admissibility in the modal system Grz and intuitionistic calculus Annals of pure and applied logic, V.50(1990), pp. 71–106.

    Google Scholar 

  18. V. V. Rybakov,Logical equations and admissible rules of inference with parameters in modal provability logics Studia Logica, V.XLIX (1990), No 2, pp. 215–239.

    Google Scholar 

  19. V. V. Rybakov,Rules of inference with parameters for intuitionistic logic Journal of Symbolic Logic, V.57(1992), No 3, pp. 912–923.

    Google Scholar 

  20. K. Segerberg,An essay in classical modal logic, Filosofiska Studier, Vol. 1 – 3, Uppsala, 1971.

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Krasnoyarsk University, Pr. Svobodnyi 79, 660 062, Krasnoyarsk, Russia

    Vladimir V. Rybakov

Authors
  1. Vladimir V. Rybakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The results of this paper were obtained by the author during a stay at the Free University of Berlin with support of the Alexander von Humboldt Foundation in 1992 – 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rybakov, V.V. Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property. Stud Logica 53, 203–225 (1994). https://doi.org/10.1007/BF01054709

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation