Cut Elimination Theorem for Non-Commutative Hypersequent Calculus

Bulletin of the Section of Logic 46 (1/2) (2017)
  Copy   BIBTEX

Abstract

Hypersequent calculi can formalize various non-classical logics. In [9] we presented a non-commutative variant of HC for the weakest temporal logic of linear frames Kt4.3 and some its extensions for dense and serial flow of time. The system was proved to be cut-free HC formalization of respective temporal logics by means of Schütte/Hintikka-style semantical argument using models built from saturated hypersequents. In this paper we present a variant of this calculus for Kt4.3 with a constructive syntactical proof of cut elimination.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2018-04-25

Downloads
20 (#181,865)

6 months
16 (#899,032)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Andrzej Indrzejczak
University of Lodz

References found in this work

The method of hypersequents in the proof theory of propositional non-classical logics.Arnon Avron - 1977 - In Wilfrid Hodges (ed.), Logic. New York: Penguin Books. pp. 1-32.

Add more references