Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T10:40:13.001Z Has data issue: false hasContentIssue false

CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME

Published online by Cambridge University Press:  13 August 2019

ANDRZEJ INDRZEJCZAK*
Affiliation:
Department of Logic, Institute of Philosophy, University of Lodz
*
*DEPARTMENT OF LOGIC INSTITUTE OF PHILOSOPHY UNIVERSITY OF LODZ LINDLEYA 3/5, 90–131 ŁÓDŹ POLAND E-mail: andrzej.indrzejczak@filozof.uni.lodz.pl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This is a sequel article to [10] where a hypersequent calculus (HC) for some temporal logics of linear frames including Kt4.3 and its extensions for dense and serial flow of time was investigated in detail. A distinctive feature of this approach is that hypersequents are noncommutative, i.e., they are finite lists of sequents in contrast to other hypersequent approaches using sets or multisets. Such a system in [10] was proved to be cut-free HC formalization of respective logics by means of semantical argument. In this article we present an equivalent variant of this calculus for which a constructive syntactical proof of cut elimination is provided.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2019