Kripke semantics for basic sequent systems

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

Abstract

We present a general method for providing Kripke semantics for the family of fully-structural multiple-conclusion propositional sequent systems. In particular, many well-known Kripke semantics for a variety of logics are easily obtained as special cases. This semantics is then used to obtain semantic characterizations of analytic sequent systems of this type, as well as of those admitting cut-admissibility. These characterizations serve as a uniform basis for semantic proofs of analyticity and cut-admissibility in such systems.

Original languageEnglish
Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - 20th International Conference, TABLEAUX 2011, Proceedings
Pages43-57
Number of pages15
DOIs
StatePublished - 2011
Event20th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2011 - Bern, Switzerland
Duration: 4 Jul 20118 Jul 2011

Publication series

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

Conference

Conference20th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2011
Country/TerritorySwitzerland
CityBern
Period4/07/118/07/11

Fingerprint

Dive into the research topics of 'Kripke semantics for basic sequent systems'. Together they form a unique fingerprint.

Cite this