Semantic investigation of canonical Gödel hypersequent systems
Ori Lahav · Journal of Logic and Computation · 2013
We define a general family of hypersequent systems with well-behaved logical rules, of which the known hypersequent calculus for (propositional) Gödel logic, is a particular instance. We present a method to obtain (possibly, non-deterministic) many-valued semantics for every system of this family. The detailed semantic analysis provides simple characterizations of cut-admissibility and axiom-expansion for the systems of this family.