☆ 4.2 Article

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

LOGIC JOURNAL OF THE IGPL (2023)

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