Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 337-360 |
Number of pages | 24 |
Journal | Journal of Logic and Computation |
Volume | 26 |
Issue number | 1 |
DOIs | |
State | Published - 14 Oct 2012 |
Keywords
- Gödel logic
- canonical systems
- hypersequents
- non-deterministic semantics
- proof theory