Fitch-Style Modal Lambda Calculi

10/23/2017
by   Ranald Clouston, et al.
0

Fitch-style modal deduction, in which modalities are eliminated by opening a subordinate proof, and introduced by shutting one, were investigated in the 1990s as a basis for lambda calculi. We show that such calculi have good computational properties for a variety of intuitionistic modal logics. Semantics are given in cartesian closed categories equipped with an adjunction of endofunctors, with the necessity modality interpreted by the right adjoint. Where this functor is an idempotent comonad, a coherence result on the semantics allows us to present a calculus for intuitionistic S4 that is simpler than others in the literature. We show the calculi can be extended à la tense logic with the left adjoint of necessity, and are then complete for the categorical semantics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2018

Modality via Iterated Enrichment

This paper investigates modal type theories by using a new categorical s...
research
07/26/2022

Normalization for Fitch-Style Modal Calculi

Fitch-style modal lambda calculi enable programming with necessity modal...
research
03/13/2015

Non-normal modalities in variants of Linear Logic

This article presents modal versions of resource-conscious logics. We co...
research
05/05/2021

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

Heyting-Lewis Logic is the extension of intuitionistic propositional log...
research
08/25/2022

A logical theory for conditional weak ontic necessity based on context update

Weak ontic necessity is the ontic necessity expressed by “should” or “ou...
research
04/15/2019

On the Lambek Calculus with an Exchange Modality

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic)...
research
10/03/2019

A Henkin-style completeness proof for the modal logic S5

This paper presents a recent formalization of a Henkin-style completenes...

Please sign up or login with your details

Forgot password? Click here to reset