Improved Second-Order Quantifier Elimination in Modal Logic
This paper introduces improvements for second-order quantifier elimination methods based on Ackermann’s Lemma and investigates their application in modal correspondence theory. In particular, we define refined calculi and procedures for solving the problem of eliminating quantified propositional symbols from modal formulae. We prove correctness results and use the approach to compute first-order frame correspondence properties for modal axioms and modal rules. Our approach can solve two new classes of formulae which have wider scope than existing classes known to be solvable by second-order quantifier elimination methods.
Unable to display preview. Download preview PDF.
- 6.Gabbay, D.M., Ohlbach, H.J.: Quantifier elimination in second-order predicate logic. S. Afr. Computer J. 7, 35–43 (1992)Google Scholar
- 7.Gabbay, D.M., Schmidt, R.A., Szałas, A.: Second-Order Quantifier Elimination: Foundations, Computational Aspects and Applications. College Publ. (2008)Google Scholar
- 9.Sahlqvist, H.: Completeness and correspondence in the first and second order semantics for modal logics. In: Proc. 3rd Scandinavian Logic Symposium, 1973, pp. 110–143. North-Holland, Amsterdam (1975)Google Scholar