Kripke Semantics for Basic Sequent Systems
- 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
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.
Unable to display preview. Download preview PDF.