Universal Proof Theory: Feasible Admissibility in Intuitionistic Modal Logics

by   Amirhossein Akbar Tabatabai, et al.

In this paper, we introduce a general family of sequent-style calculi over the modal language and its fragments to capture the essence of all constructively acceptable systems. Calling these calculi constructive, we show that any strong enough constructive sequent calculus, satisfying a mild technical condition, feasibly admits all Visser's rules, i.e., there is a polynomial time algorithm that reads a proof of the premise of a Visser's rule and provides a proof for its conclusion. As a positive application, we show the feasible admissibility of Visser's rules in several sequent calculi for intuitionistic modal logics, including 𝖒π–ͺ, 𝖨π–ͺ and their extensions by the modal axioms T, B, 4, 5, the modal axioms of bounded width and depth and the propositional lax logic. On the negative side, we show that if a strong enough intuitionistic modal logic (satisfying a mild technical condition) does not admit at least one of Visser's rules, then it cannot have a constructive sequent calculus. Consequently, no intermediate logic other than 𝖨𝖯𝖒 has a constructive sequent calculus.


page 1

page 2

page 3

page 4

βˆ™ 10/18/2022

Wijesekera-style constructive modal logics

We define a family of propositional constructive modal logics correspond...
βˆ™ 04/11/2023

Canonicity in Modal Lambda Calculus

In this paper we investigate the Curry-Howard-Lambek correspondence for ...
βˆ™ 09/05/2023

Minimal modal logics, constructive modal logics and their relations

We present a family of minimal modal logics (namely, modal logics based ...
βˆ™ 08/09/2022

Uniform Lyndon interpolation for intuitionistic monotone modal logic

In this paper we show that the intuitionistic monotone modal logic 𝗂𝖬 ha...
βˆ™ 01/28/2019

Intuitionistic Non-Normal Modal Logics: A general framework

We define a family of intuitionistic non-normal modal logics; they can b...
βˆ™ 02/10/2021

Finite axiomatizability of logics of distributive lattices with negation

This paper focuses on order-preserving logics defined from varieties of ...
βˆ™ 05/01/2017

A polynomial time algorithm for the Lambek calculus with brackets of bounded order

Lambek calculus is a logical foundation of categorial grammar, a linguis...

Please sign up or login with your details

Forgot password? Click here to reset