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

Studia Logica 55 (3):421 - 448 (1995)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Modal sequents and definability.Bruce M. Kapron - 1987 - Journal of Symbolic Logic 52 (3):756-762.
Modal logic over finite structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
Elementary definability and completeness in general and positive modal logic.Ernst Zimmermann - 2003 - Journal of Logic, Language and Information 12 (1):99-117.
Cylindric modal logic.Yde Venema - 1995 - Journal of Symbolic Logic 60 (2):591-623.

Analytics

Added to PP
2009-01-28

Downloads
52 (#293,581)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Definability in the class of all -frames – computability and complexity.D. T. Georgiev - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):1-26.

Add more citations

References found in this work

Logical constants across varying types.Johan van Benthem - 1989 - Notre Dame Journal of Formal Logic 30 (3):315-342.
Model Theory.Gebhard Fuhrken - 1976 - Journal of Symbolic Logic 41 (3):697-699.
First-order definability in modal logic.R. I. Goldblatt - 1975 - Journal of Symbolic Logic 40 (1):35-40.
An undecidable problem in correspondence theory.L. A. Chagrova - 1991 - Journal of Symbolic Logic 56 (4):1261-1272.

View all 7 references / Add more references