Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication

by   Jim de Groot, et al.

Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of this logic are surprisingly widespread: they appear as Curry-Howard correspondents of (simple type theory extended with) Haskell-style arrows, in preservativity logic of Heyting arithmetic, in the proof theory of guarded (co)recursion, and in the generalization of intuitionistic epistemic logic. Heyting-Lewis Logic can be interpreted in intuitionistic Kripke frames extended with a binary relation to account for strict implication. We use this semantics to define descriptive frames (generalisations of Esakia spaces), and establish a categorical duality between the algebraic interpretation and the frame semantics. We then adapt a transformation by Wolter and Zakharyaschev to translate Heyting-Lewis Logic to classical modal logic with two unary operators. This allows us to prove a Blok-Esakia theorem that we then use to obtain both known and new canonicity and correspondence theorems, and the finite model property and decidability for a large family of Heyting-Lewis logics.



There are no comments yet.


page 1

page 2

page 3

page 4


Non axiomatizability of Modal Lukasiewicz Logic

In this work we study the decidability of the global modal logic arising...

Goldblatt-Thomason Theorems for Modal Intuitionistic Logics

We prove Goldblatt-Thomason theorems for frames and models of a wide var...

Sahlqvist Correspondence Theory for Sabotage Modal Logic

Sabotage modal logic (SML) is a kind of dynamic logics. It extends stati...

Probabilistic logics based on Riesz spaces

We introduce a novel real-valued endogenous logic for expressing propert...

Stone-Type Dualities for Separation Logics

Stone-type duality theorems, which relate algebraic and relational/topol...

Computability logic: Giving Caesar what belongs to Caesar

The present article is a brief informal survey of computability logic --...

Some modal and temporal translations of generalized basic logic

We introduce a family of modal expansions of Łukasiewicz logic that are ...
This week in AI

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