Admissibility and Unification in the Modal Logics Related to S4.2
-
Published:2024-01
Issue:1
Volume:65
Page:167-173
-
ISSN:0037-4466
-
Container-title:Siberian Mathematical Journal
-
language:en
-
Short-container-title:Sib Math J
Publisher
Pleiades Publishing Ltd
Reference39 articles.
1. Robinson A., “A machine oriented logic based on the resolution principle,” J. Assoc. Comput. Mach., vol. 12, no. 1, 23–41 (1965).
2. Knuth D.E. and Bendix P.B., “Simple word problems in universal algebras,” in: Automation of Reasoning, Springer, Berlin and Heidelberg (1983), 342–376 (Symbolic Computations; vol. 1064).
3. Baader F. and Snyder W., “Unification theory,” in: Handbook of Automated Reasoning. I, Elsevier, Amsterdam (2001), 445–533.
4. Baader F. and Ghilardi S., “Unification in modal and description logics,” Logic J. IGPL, vol. 19, no. 6, 705–730 (2011).
5. Baader F. and Morawska B., “Unification in the description logic EL,” Log. Methods Comput. Sci., vol. 6, 1–31 (2010).