Journal of Symbolic Logic

Constructive interpolation in hybrid logic

Patrick Blackburn and Maarten Marx

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Craig’s interpolation lemma (if $φ\rightarrowψ$ is valid, then $φ\rightarrowθ$ and $θ\rightarrowψ$ are valid, for θ a formula constructed using only primitive symbols which occur both in φ and ψ) fails for many propositional and first order modal logics. The interpolation property is often regarded as a sign of well-matched syntax and semantics. Hybrid logicians claim that modal logic is missing important syntactic machinery, namely tools for referring to worlds, and that adding such machinery solves many technical problems. The paper presents strong evidence for this claim by defining interpolation algorithms for both propositional and first order hybrid logic. These algorithms produce interpolants for the hybrid logic of every elementary class of frames satisfying the property that a frame is in the class if and only if all its point-generated subframes are in the class. In addition, on the class of all frames, the basic algorithm is conservative: on purely modal input it computes interpolants in which the hybrid syntactic machinery does not occur.

Article information

Source
J. Symbolic Logic, Volume 68, Issue 2 (2003), 463- 480.

Dates
First available in Project Euclid: 11 May 2003

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1052669059

Digital Object Identifier
doi:10.2178/jsl/1052669059

Mathematical Reviews number (MathSciNet)
MR1976586

Zentralblatt MATH identifier
1059.03020

Citation

Blackburn, Patrick; Marx, Maarten. Constructive interpolation in hybrid logic. J. Symbolic Logic 68 (2003), no. 2, 463-- 480. doi:10.2178/jsl/1052669059. https://projecteuclid.org/euclid.jsl/1052669059


Export citation

References

  • C. Areces, P. Blackburn, and M. Marx Hybrid logics: Characterization, interpolation and complexity, Journal of Symbolic Logic, vol. 66 (2001), no. 3, pp. 977--1010.
  • C. Areces, P. Blackburn, and M. Marx Repairing the interpolation lemma in quantified modal logic, Technical Report PP-2001-19, Institute for Language, Logic and Computation,2001, To appear in series Annals of Pure and Applied Logic.
  • P. Blackburn, M. de Rijke, and Y. Venema Modal logic, Cambridge University Press,2001.
  • P. Blackburn and M. Marx Tableaux for quantified hybrid logic, Automated reasoning with analytic tableaux and related methods, TABLEAUX 2002 (U. Egly and C. Fermüller, editors), LNAI, vol. 2381, Springer Verlag,2002, pp. 38--52.
  • M. de Rijke The modal logic of inequality, Journal of Symbolic Logic, vol. 57 (1992), pp. 566--584.
  • K. Fine Failures of the interpolation lemma in quantified modal logic, Journal of Symbolic Logic, vol. 44 (1979), no. 2, pp. 201--206.
  • M. Fitting Proof methods for modal and intuitionistic logics, Synthese Library, vol. 169, Reidel, Dordrecht,1983.
  • L. Maksimova Amalgamation and interpolation in normal modal logics, Studia Logica, vol. L (1991), no. 3/4, pp. 457--471.
  • M. Marx and Y. Venema Multi-dimensional modal logic, Applied Logic Series, Kluwer Academic Publishers,1997.
  • W. Rautenberg Modal tableau calculi and interpolation, Journal of Philosophical Logic, vol. 12 (1983), pp. 403--423.
  • R. Smullyan First order logic, Springer--Verlag,1968.