Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic

We consider an extension of bi-intuitionistic logic with the traditional modalities from tense logic Kt. Proof theoretically, this extension is obtained simply by extending an existing sequent calculus for bi-intuitionistic logic with typical inference rules for the modalities used in display logics...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Gore, Rajeev, Postniece, Linda, Tiu, Alwen
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Logic in Computer Science
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!