Sahlqvist Correspondence Theory for Second-Order Propositional Modal Logic

10/16/2021
by   Zhiguang Zhao, et al.
0

Modal logic with propositional quantifiers (i.e. second-order propositional modal logic (SOPML)) has been considered since the early time of modal logic. Its expressive power and complexity are high, and its van-Benthem-Rosen theorem and Goldblatt-Thomason theorem have been proved by ten Cate (2006). However, the Sahlqvist theory of SOPML has not been considered in the literature. In the present paper, we fill in this gap. We develop the Sahlqvist correspondence theory for SOPML, which covers and properly extends existing Sahlqvist formulas in basic modal logic. We define the class of Sahlqvist formulas for SOMPL step by step in a hierarchical way, each formula of which is shown to have a first-order correspondent over Kripke frames effectively computable by an algorithm ALBA^SOMPL. In addition, we show that certain Π_2-rules correspond to Π_2-Sahlqvist formulas in SOMPL, which further correspond to first-order conditions, and that even for very simple SOMPL Sahlqvist formulas, they could already be non-canonical.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2018

A van Benthem Theorem for Fuzzy Modal Logic

We present a fuzzy (or quantitative) version of the van Benthem theorem,...
research
06/13/2022

A Sahlqvist-style Correspondence Theorem for Linear-time Temporal Logic

The language of modal logic is capable of expressing first-order conditi...
research
02/26/2021

Algorithmic Correspondence for Hybrid Logic with Binder

In the present paper, we develop the algorithmic correspondence theory f...
research
09/18/2019

A Tractable Logic for Molecular Biology

We introduce a logic for knowledge representation and reasoning on prote...
research
03/04/2021

Wanted Dead or Alive : Epistemic logic for impure simplicial complexes

We propose a logic of knowledge for impure simplicial complexes. Impure ...
research
12/01/2014

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas

Canonical (logic) programs (CP) refer to normal logic programs augmented...
research
02/15/2021

On synthesizing Skolem functions for first order logic formulae

Skolem functions play a central role in logic, from eliminating quantifi...

Please sign up or login with your details

Forgot password? Click here to reset