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

08/15/2018
by   Philippe Balbiani, et al.
0

We introduce frame-equivalence games tailored 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. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

11/21/2019

Recursive enumerability and elementary frame definability in predicate modal logic

We investigate the relationship between recursive enumerability and elem...
02/15/2021

Depth lower bounds in Stabbing Planes for combinatorial principles

We prove logarithmic depth lower bounds in Stabbing Planes for the class...
06/17/2019

Lower Bounds and Conditioning of Differentiable Games

Many recent machine learning tools rely on differentiable game formulati...
12/06/2019

The canonical pairs of bounded depth Frege systems

The canonical pair of a proof system P is the pair of disjoint NP sets w...
02/11/2021

Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames

It has been shown in the late 1960s that each formula of first-order log...
02/21/2022

Defining long words succinctly in FO and MSO

We consider the length of the longest word definable in FO and MSO via a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.