Kripke Semantics for Basic Sequent Systems

  • Arnon Avron
  • Ori Lahav
Conference paper

DOI: 10.1007/978-3-642-22119-4_6

Volume 6793 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Avron A., Lahav O. (2011) Kripke Semantics for Basic Sequent Systems. In: Brünnler K., Metcalfe G. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2011. Lecture Notes in Computer Science, vol 6793. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Arnon Avron
    • 1
  • Ori Lahav
    • 1
  1. 1.School of Computer ScienceTel Aviv UniversityIsrael