A simple tableau system for the logic of elsewhere

  • Stéphane Demri
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1071)


We analyze different features related to the mechanization of von Wright's logic of elsewhere ε. First, we give a new proof of the NP-completeness of the satisfiability problem (giving a new bound for the size of models of the satisfiable formulae) and we show that this problem becomes linear-time when the number of propositional variables is bounded. Although ε and the well-known propositional modal S5 share numerous common features we show that ε is strictly more expressive than S5 (in a sense to be specified). Second, we present a prefixed tableau system for ε and we prove both its soundness and completeness. Two extensions of this system are also defined, one related to the logical consequence relation and the other related to the addition of modal operators (without increasing the expressive power). An example of tableau proof is also presented. Different continuations of this work are proposed, one of them being to implement the defined tableau system, another one being to extend this system to richer logics that can be found in the literature.


Induction Hypothesis Modal Logic Proof System Propositional Variable Satisfiability Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Cat91]
    L. Catach. Tableaux: a general theorem prover for modal logics. Journal of Automated Reasoning, 7:489–510, 1991.Google Scholar
  2. [Coo71]
    S. Cook. The complexity of theorem-proving procedures. In Third Annual ACM Symposium on Theory of Computing, pages 151–158, 1971.Google Scholar
  3. [CW69]
    J. Corcoran and G. Weaver. Logical consequence in modal logic: natural deduction in S5. Notre Dame Journal of Formal Logic, 10(4):370–384, October 1969.Google Scholar
  4. [Dem95]
    S. Demri. Uniform and non uniform strategies for tableaux calculi for modal logics. Journal of Applied Non Classical Logics, 5(1):77–96, 1995.Google Scholar
  5. [DJP77]
    B. Davidson, F. C. Jackson, and R. Pargetter. Modal trees for T and S5. Notre Dame Journal of Formal Logic, 18(4):602–606, October 1977.Google Scholar
  6. [dR92]
    M. de Rijke. The modal logic of inequality. Journal of Symbolic Logic, 57(2):566–584, June 1992.Google Scholar
  7. [DSVEB90]
    B. De Smit and P. Van Emde Boas. The complexity of the modal difference operator in propositional logic, 1990. Unpublished note, University of Amsterdam.Google Scholar
  8. [FdC83]
    L. Fariñas del Cerro. Un principe de résolution en logique modale. RAIRO, 18:161–170, 1983.Google Scholar
  9. [Fey65]
    R. Feys. Modal logics. B. Gauthier-Villars, Paris, 1965.Google Scholar
  10. [FHV92]
    R. Fagin, J. Y. Halpern, and M. Y. Vardi. What is an inference rule? Journal of Symbolic Logic, 57(3):1018–1045, September 1992.Google Scholar
  11. [Fit77]
    M. C. Fitting. A tableau system for propositional S5. Notre Dame Journal of Formal Logic, 18(2):292–294, 1977.Google Scholar
  12. [Fit83]
    M. C. Fitting. Proof methods for modal and intuitionistic logics. D. Reidel Publishing Co., 1983.Google Scholar
  13. [Fit88]
    M. C. Fitting. First-order modal tableaux. Journal of Automated Reasoning, 4:191–213, 1988.Google Scholar
  14. [GG93]
    G. Gargov and V. Goranko. Modal logic with names. Journal of Philosophical Logic, 22(6):607–636, December 1993.Google Scholar
  15. [Gor90]
    V. Goranko. Modal definability in enriched languages. Notre Dame Journal of Formal Logic, pages 81–105, 1990.Google Scholar
  16. [Gor92]
    R. P. Goré. Cut-free sequents and tableau systems for propositional normal modal logics. PhD thesis, University of Cambridge, England, May 1992.Google Scholar
  17. [Gov95]
    G. Governatori. Labelled tableaux for multi-modal logics. In P. Baumgartner, R. Hähnle, and J. Posegga, editors, Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 79–94. LNAI 918, Springer-Verlag, May 1995.Google Scholar
  18. [GP92]
    V. Goranko and S. Passy. Using the universal modality: gains and questions. Journal of Logic Computation, 2(1):5–30, 1992.Google Scholar
  19. [GPT87]
    G. Gargov, G. Passy, and T. Tinchev. Modal environment for boolean speculations. In D. Skordev, editor, Mathematical logic and its applications, pages 253–263. Plenum Press, 1987.Google Scholar
  20. [Hal95]
    J. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence, 75(2):361–372, 1995.Google Scholar
  21. [HC68]
    G. Hughes and M. Cresswell. An introduction to modal logic. Methuen and Co., 1968.Google Scholar
  22. [HM92]
    J. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319–379, 1992.Google Scholar
  23. [Lad77]
    R. E. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing, 6(3):467–480, September 1977.Google Scholar
  24. [Mas94]
    F. Massacci. Strongly analytic tableaux for normal modal logics. In A. Bundy, editor, CADE-12, Mancy, pages 723–737. Springer Verlag, LNAI 814, July 1994.Google Scholar
  25. [MMO95]
    P. Miglioli, U. Moscato, and M. Ornhagi. Refutation systems for propositional modal logics. In P. Baumgartner, R. Hähnle, and J. Posegga, editors, Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 95–105. LNAI 918, Springer-Verlag, May 1995.Google Scholar
  26. [Non95]
    A. Nonnengart. A resolution-based calculus for temporal logics. PhD thesis, Universität des Saarlandes, November 1995.Google Scholar
  27. [Ogn94]
    Z. Ognjanović. A tableau-like proof procedure for normal modal logics. Theoretical Computer Science, 129:167–186, 1994.Google Scholar
  28. [OSH95]
    H. J. Ohlbach, R. Schmidt, and Hustadt. Translating graded modalities into predicate logic. Technical Report MPI-I-95-2-008, Max-Planck-Institute Für Informatik, May 1995.Google Scholar
  29. [PT91]
    S. Passy and T. Tinchev. An essay in combinatory dynamic logic. Information and Computation, 93:263–332, 1991.Google Scholar
  30. [Sat80]
    M. Sato. A cut-free Gentzen-type system for the modal logic S5. The Journal of Symbolic Logic, 45(1):67–84, March 1980.Google Scholar
  31. [Seg81]
    K. Segerberg. A note on the logic of elsewhere. Theoria, 47:183–187, 1981.Google Scholar
  32. [Smu68]
    R. M. Smullyan. First-Order Logic. Springer-Verlag, 1968.Google Scholar
  33. [WW85]
    L. Wallen and G. Wilson. Automated deduction in S5 modal logic: theory and implementation. Technical Report DAI-315, University of Edinburgh, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Stéphane Demri
    • 1
  1. 1.Leibniz-ImagGrenoble CedexFrance

Personalised recommendations