Kripke semantics for basic sequent systems

Authors:
Arnon Avron;Ori Lahav
Affiliations:
School of Computer Science, Tel Aviv University, Israel;School of Computer Science, Tel Aviv University, Israel
Venue:
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Year:
2011

Citing 7
Cited 1

Basic proof theory

Basic proof theory
Subtractive logic

Theoretical Computer Science
Canonical Propositional Gentzen-Type Systems

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Classical Gentzen-type methods in propositional many-valued logics

Beyond two
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic

Journal of Logic and Computation
Logic of infons: The propositional case

ACM Transactions on Computational Logic (TOCL)

A unified semantic framework for fully structural propositional sequent systems

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

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.