Skip to main content
SpringerLink
Log in

Unification in Pretabular Extensions of S4

  • Published:
Logica Universalis Aims and scope Submit manuscript

Abstract

L.L. Maksimova and L. Esakia, V. Meskhi showed that the modal logic \({\mathcal {S}}4\) has exactly 5 pretabular extensions PM1–PM5. In this paper, we study the problem of unification for all given logics. We showed that PM2 and PM3 have finitary, and PM1, PM4, PM5 have unitary types of unification. Complete sets of unifiers in logics are described.

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

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Baader, F., Ghilardi, S.: Unification in modal and description logics. Log. J. IGPL 19, 705–730 (2011)

    Article  MathSciNet  Google Scholar 

  2. Baader, F., Snyder, W.: Unification Theory. Elsevier, Amsterdam (2001)

    Book  Google Scholar 

  3. Balbiani, P., Gencer, C., Rostamigiv, M., Tinchev, T.: About the unification types of the modal logics determined by classes of deterministic frames. arXiv:2004.07904 (2020)

  4. Bashmakov, S.I.: Unification in linear modal logic on non-transitive time with the universal modality. J. Sib. Fed. Univ. Math. Phys. 11, 3–9 (2018)

    Article  MathSciNet  Google Scholar 

  5. Bashmakov, S.I., Kosheleva, A.V., Rybakov, V.V.: Unification for multi-agent temporal logics with universal modality. J. Log. Appl. 4, 939–954 (2017)

    Google Scholar 

  6. Bashmakov, S.I., Kosheleva, A.V., Rybakov, V.V.: Projective formulas and unification in linear discrete temporal multi-agent logics. Sib. Electron. Math. Rep. 13, 923–929 (2016)

    MathSciNet  MATH  Google Scholar 

  7. Burris, S.: Discriminator varieties and symbolic computation. Symb. Comput. 13, 175–207 (1992)

    Article  MathSciNet  Google Scholar 

  8. Dzik, W.: Unitary unification of s5 modal logic and its extensions. Bull. Sect. Log. 32, 19–26 (2003)

    MathSciNet  MATH  Google Scholar 

  9. Dzik, W.: Remarks on projective unifiers. Bull. Sect. Log. 40, 37–46 (2011)

    MathSciNet  MATH  Google Scholar 

  10. Dzik, W., Wojtylak, P.: Projective unification in modal logic. Log. J. IGPL 20, 121–153 (2012)

    Article  MathSciNet  Google Scholar 

  11. Esakia, L., Meskhi, V.: Five critical modal systems. Theoria 43, 52–60 (1977)

    Article  MathSciNet  Google Scholar 

  12. Ghilardi, S.: Unification through projectivity. J. Log. Comput. 7, 733–752 (1997)

    Article  MathSciNet  Google Scholar 

  13. Ghilardi, S.: Best solving modal equations. Ann. Pure Appl. Log. 102, 183–198 (2000)

    Article  MathSciNet  Google Scholar 

  14. Iemhoff, R.: On the admissible rules of intuitionistic propositional logic. J. Symb. Log. 66, 281–294 (2001)

    Article  MathSciNet  Google Scholar 

  15. Iemhoff, R.: A syntactic approach to unification in transitive reflexive modal logics. Notre Dame J. Form. Log. 57, 233–247 (2016)

    MathSciNet  MATH  Google Scholar 

  16. Jerábek, E.: Blending margins: the modal logic k has nullary unification type. J. Log. Comput. 25, 1231–1240 (2015)

    Article  MathSciNet  Google Scholar 

  17. Maksimova, L.L.: Pretabular extensions of lewis S4. Algebra Log. 14, 16–33 (1975)

    Article  MathSciNet  Google Scholar 

  18. Maksimova, L.L.: LC and its pretabular relatives. Michael Dunn on Information Based Logics, pp. 81–91. Springer, New York (2016)

    Chapter  Google Scholar 

  19. Maksimova, L.L., Voronkov, A.: Complexity of Some Problems in Modal and Intuitionistic Calculi. In: Baaz M., Makowsky J.A. (eds) Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol 2803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45220-1_32

  20. Novikova, T.A., Zakharov, V.A.: Unification of programs. Proc. Inst. Syst. Program. RAS 23, 455–476 (2012)

    Article  Google Scholar 

  21. Rimatskii, V.V.: Bases of admissible inference rules for table modal logics of depth 2. Algebra Log. 35, 344–349 (1996)

    Article  MathSciNet  Google Scholar 

  22. Rimatskii, V.V., Kiyatkin, V.R.: Independent bases for admissible rules of pretabular modal logic and its extensions. Algebra Log. 10, 79–89 (2013)

    MATH  Google Scholar 

  23. Robinson, A.: A machine oriented logic based on the resolution principle. J. ACM 12, 23–41 (1965)

    Article  MathSciNet  Google Scholar 

  24. Rybakov, V.V.: A criterion for admissibility of rules in the model system s4 and the intuitionistic logic. Algebra Log. 23, 369–384 (1984)

    Article  Google Scholar 

  25. Rybakov, V.V.: Decidability of the admissibility problem in layer-finite modal logics. Algebra Log. 23, 75–87 (1984)

    Article  Google Scholar 

  26. Rybakov, V.V.: Admissible Logical Inference Rules, Studies in Logic and Foundations of Mathematics. Elsevier, North-Holland (1997)

    Google Scholar 

  27. Rybakov, V.V.: Best unifiers in transitive modal logics. Stud. Log. 99, 321–336 (2011)

    Article  MathSciNet  Google Scholar 

  28. Scroggs, J.: Extentions of S5. J. Symb. Log. 16, 112–120 (1951)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, Siberian Federal University, Svobodny 79, Krasnoyarsk, Russia, 660041

    Stepan I. Bashmakov

Authors
  1. Stepan I. Bashmakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stepan I. Bashmakov.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work is supported by the Krasnoyarsk Mathematical Center and financed by the Ministry of Science and Higher Education of the Russian Federation in the framework of the establishment and development of regional Centers for Mathematics Research and Education (Agreement No. 075-02-2021-1388)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bashmakov, S.I. Unification in Pretabular Extensions of S4. Log. Univers. 15, 381–397 (2021). https://doi.org/10.1007/s11787-021-00287-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11787-021-00287-0

Keywords

Mathematics Subject Classification

Search

Navigation