Cut-admissibility as a corollary of the subformula property

Ori Lahav, Yoni Zohar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We identify two wide families of propositional sequent calculi for which cut-admissibility is a corollary of the subformula property. While the subformula property is often a simple consequence of cut-admissibility, our results shed light on the converse direction, and may be used to simplify cut-admissibility proofs in various propositional sequent calculi. In particular, the results of this paper may be used in conjunction with existing methods that establish the subformula property, to obtain that cut-admissibility holds as well.

Original languageEnglish
Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - 26th International Conference, TABLEAUX 2017, Proceedings
EditorsClaudia Nalon, Renate A. Schmidt
PublisherSpringer Verlag
Pages65-80
Number of pages16
ISBN (Print)9783319669014
DOIs
StatePublished - 2017
Externally publishedYes
Event26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2017 - Brasilia, Brazil
Duration: 25 Sep 201728 Sep 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10501 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2017
Country/TerritoryBrazil
CityBrasilia
Period25/09/1728/09/17

Fingerprint

Dive into the research topics of 'Cut-admissibility as a corollary of the subformula property'. Together they form a unique fingerprint.

Cite this