VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED

Valentini (1983) has presented a proof of cut-elimination for provability logic GL for a sequent calculus using sequents built from sets as opposed to multisets, thus avoiding an explicit contraction rule. From a formal point of view, it is more syntactic and satisfying to explicitly identify the ap...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The review of symbolic logic 2012-06, Vol.5 (2), p.212-238
Hauptverfasser:	GORÉ, RAJEEV, RAMANAYAKE, REVANTHA
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!