Display to Labelled Proofs and Back Again for Tense Logics

11/06/2019
by   Agata Ciabattoni, et al.
0

We introduce translations between display calculus proofs and labelled calculus proofs in the context of tense logics. First, we show that every derivation in the display calculus for the minimal tense logic Kt extended with general path axioms can be effectively transformed into a derivation in the corresponding labelled calculus. Concerning the converse translation, we show that for Kt extended with path axioms, every derivation in the corresponding labelled calculus can be put into a special form that is easily translatable to a derivation in the display calculus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2020

Lambek-Grishin Calculus: Focusing, Display and Full Polarization

Focused sequent calculi are a refinement of sequent calculi, where addit...
research
07/21/2022

A Labelled Sequent Calculus for Public Announcement Logic

Public announcement logic(PAL) is an extension of epistemic logic (EL) w...
research
02/23/2021

Syntactic completeness of proper display calculi

A recent strand of research in structural proof theory aims at exploring...
research
10/15/2019

On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems

This paper shows how to derive nested calculi from labelled calculi for ...
research
02/10/2021

Finite axiomatizability of logics of distributive lattices with negation

This paper focuses on order-preserving logics defined from varieties of ...
research
05/23/2018

A Simple Re-Derivation of Onsager's Solution of the 2D Ising Model using Experimental Mathematics

In this case study, we illustrate the great potential of experimental ma...
research
05/22/2023

SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning

We show that SCL(FOL) can simulate the derivation of non-redundant claus...

Please sign up or login with your details

Forgot password? Click here to reset