zbMATH — the first resource for mathematics

Unification and passive inference rules for modal logics. (English) Zbl 1040.03014
Summary: We study unification of formulas in modal logics and consider logics which are equivalent w.r.t. unification of formulas. A criterion is given for equivalence w.r.t. unification via existence or persistent formulas. A complete syntactic description of all formulas which are non-unifiable in wide classes of modal logics is given. Passive inference rules are considered, it is shown that in any modal logic over D4 there is a finite basis for passive rules.

03B45 Modal logic (including the logic of norms)
03B55 Intermediate logics
03B35 Mechanization of proofs and logical operations
Full Text: DOI
[1] Chagrov A., Modal Logics.–Clarendon Press, Oxford (1997) · Zbl 0871.03007
[2] Ghilardi Silvio., accepted for J. of Symbolic Logic (1997)
[3] Ghilardi Silvio., Unification and projectivity in proposition al Logic.- Preprint No.58/1996, Milano University, Italy (1996)
[4] Fine K., J. of Symbolic Logic 39 pp 229– (1974)
[5] Martin U., J. of Symb. Comput. 7 pp 328– (1989)
[6] Rybakov V. V., Sibirski Math. Journal 25 pp 1984– (1984)
[7] Rybakov V. V., Studia Logica 53 (1994)
[8] Rybakov V. V., Admissibility of Logical Inference Rules.–Studies in Logic and Foundations of Mathematics. 136 (1997) · Zbl 0872.03002
[9] Snyder W., J. of Symb. Comput. 7 pp 207– (1989) · Zbl 0678.68098
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.