4.2 Article

On semantically labelled syntax trees and the non-existence of certain Sahlqvist formulae

Related references

Note: Only part of the references are listed.
Article Mathematics, Applied

Frame-validity games and lower bounds on the complexity of modal axioms

Philippe Balbiani et al.

Summary: We introduce frame-equivalence games that are designed for reasoning about the size, modal depth, number of occurrences of symbols, and number of different propositional variables of modal formulae defining a given frame property. By using these games, we establish lower bounds on the aforementioned measures for several well-known modal axioms; moreover, for some of the axioms, we demonstrate their optimality among the formulae defining the respective class of frames.

LOGIC JOURNAL OF THE IGPL (2022)

Article Computer Science, Theory & Methods

Formula size games for modal logic and μ-calculus

Lauri T. Hella et al.

JOURNAL OF LOGIC AND COMPUTATION (2019)

Article Computer Science, Theory & Methods

Algebraic modal correspondence: Sahlqvist and beyond

Willem Conradie et al.

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING (2017)

Article Computer Science, Artificial Intelligence

On the succinctness of some modal logics

Tim French et al.

ARTIFICIAL INTELLIGENCE (2013)

Article Mathematics, Applied

Elementary canonical formulae: extending Sahlqvist's theorem

Valentin Goranko et al.

ANNALS OF PURE AND APPLIED LOGIC (2006)