Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics

09/01/2023
by   Anupam Das, et al.
0

We derive an intuitionistic version of Gödel-Löb modal logic (GL) in the style of Simpson, via proof theoretic techniques. We recover a labelled system, ℓ IGL, by restricting a non-wellfounded labelled system for GL to have only one formula on the right. The latter is obtained using techniques from cyclic proof theory, sidestepping the barrier that GL's usual frame condition (converse well-foundedness) is not first-order definable. While existing intuitionistic versions of GL are typically defined over only the box (and not the diamond), our presentation includes both modalities. Our main result is that ℓ IGL coincides with a corresponding semantic condition in birelational semantics: the composition of the modal relation and the intuitionistic relation is conversely well-founded. We call the resulting logic IGL. While the soundness direction is proved using standard ideas, the completeness direction is more complex and necessitates a detour through several intermediate characterisations of IGL.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2021

On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics

This paper studies the relationship between labelled and nested calculi ...
research
05/07/2022

A theorem prover and countermodel constructor for provability logic in HOL Light

We introduce our implementation in HOL Light of a prototype of a general...
research
12/17/2020

Formalization of PAL·S5 in Proof Assistant

As an experiment to the application of proof assistant for logic researc...
research
05/15/2019

A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic

We define a infinitary labelled sequent calculus for PDL, G3PDL^∞. A fin...
research
06/09/2019

From QBFs to MALL and back via focussing: fragments of multiplicative additive linear logic for each level of the polynomial hierarchy

In this work we investigate how to extract alternating time bounds from ...
research
01/03/2020

Simple explanation of Landauer's bound and its ineffectiveness for multivalued logic

We discuss, using recent results on the Landauer's bound in multivalued ...
research
06/26/2018

The temporal logic of two-dimensional Minkowski spacetime with slower-than-light accessibility is decidable

We work primarily with the Kripke frame consisting of two-dimensional Mi...

Please sign up or login with your details

Forgot password? Click here to reset