Skip to main content
SpringerLink
Log in

Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

The main result is that is no effective algorithmic answer to the question:how to recognize whether arbitrary modal formula has a first-order equivalent on the class of finite frames. Besides, two known problems are solved: it is proved algorithmic undecidability of finite frame consequence between modal formulas; the difference between global and local variants of first-order definability of modal formulas on the class of transitive frames is shown.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. F. A. K. van Benthem,Modal Logic and Classical Logic, Bibliopolis, Napoli, 1985.

    Google Scholar 

  2. J. F. A. K. van Benthem, Notes on Modal Definability,Notre Dame Journal of Formal Logic, vol.30 (1989), pp. 20–35.

    Google Scholar 

  3. A. V. Chagrov, Undecidable Properties of Extensions of Provability Logic, I, II,Algebra i Logica, vol.29 (1990), pp. 350–367, 613–623 (Russian).

    Google Scholar 

  4. A. V. Chagrov, Undecidability of Finite Semantic Consequence,Proceeding of 10th USSR Conference on Mathematical Logic, Alma-Ata, 1990, p. 162.

  5. A. V. Chagrov, M. V. Zakharyaschev The Undecidability of the Disjunction Property and other related problems,Journal of Symbolic Logic, vol.58 (1993), pp. 967–1002.

    Google Scholar 

  6. L. A. Chagrova, An Undecidable Problem in Correspondence Theory,Journal of Symbolic Logic, vol.56 (1991), pp. 1261–1272.

    Google Scholar 

  7. L. A. Chagrova, An Undecidable Problem in Correspondence Theory for Finite Frames, (in preparation).

  8. C. C. Chang, H. J. Keisler,Model Theory, North-Holland, Amsterdam, 1973.

    Google Scholar 

  9. H. C. Doets,Completeness and Definability. Applications of the Ehrenfeucht Game in Second-order and Intensional Logic, Dissertation, Mathematical Institute, University of Amsterdam, 1987.

  10. A. Ehrenfeucht, An Application of Games to the Completeness Problem for Formalized Theories,Fundamenta Mathematicae, vol.49 (1961), pp. 128–141.

    Google Scholar 

  11. R. I. Goldblatt, First-order Definability in Modal Logic,Journal of Symbolic Logic, vol.40 (1975), pp. 35–40.

    Google Scholar 

  12. S. Isard, A Finitely Axiomatizable Undecidable Extension of K,Theoria, vol.43 (1977), pp. 195–202.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tveŕ State University, Zhelyabov str. 33, 170000, Tveŕ, Russia

    A. V. Chagrov & L. A. Chagrova

Authors
  1. A. V. Chagrov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. A. Chagrova
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chagrov, A.V., Chagrova, L.A. Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames. Stud Logica 55, 421–448 (1995). https://doi.org/10.1007/BF01057806

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01057806

Keywords

Search

Navigation