Universal Proof Theory: Feasible Admissibility in Intuitionistic Modal Logics

In this paper, we introduce a general family of sequent-style calculi over the modal language and its fragments to capture the essence of all constructively acceptable systems. Calling these calculi \emph{constructive}, we show that any strong enough constructive sequent calculus, satisfying a mild...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Tabatabai, Amirhossein Akbar, Jalali, Raheleh
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Logic in Computer Science Mathematics - Logic
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!