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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Avron, A., & Lahav, O. (2011). Kripke semantics for basic sequent systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6793 LNAI, pp. 43–57). https://doi.org/10.1007/978-3-642-22119-4_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
