Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
91 tokens/sec
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
o3 Pro
5 tokens/sec
GPT-4.1 Pro
15 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
Gemini 2.5 Flash Deprecated
12 tokens/sec
2000 character limit reached

Sahlqvist Correspondence Theory for Sabotage Modal Logic (2003.08070v3)

Published 18 Mar 2020 in math.LO and cs.LO

Abstract: Sabotage modal logic (SML) is a kind of dynamic logics. It extends static modal logic with a dynamic modality which is interpreted as "after deleting an arrow in the frame, the formula is true". In the present paper, we are aiming at solving an open problem, namely giving a Sahlqvist-type correspondence theorem for sabotage modal logic. In this paper, we define sabotage Sahlqvist formulas and give an algorithm to compute the first-order correspondents of sabotage Sahlqvist formulas. We give some remarks and future directions at the end of the paper.

Citations (2)

Summary

We haven't generated a summary for this paper yet.