Basic proof theory
The method of hypersequents in the proof theory of propositional non-classical logics
Logic: from foundations to applications
A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Sequent and hypersequent calculi for abelian and łukasiewicz logics
ACM Transactions on Computational Logic (TOCL)
Towards an algorithmic construction of cut-elimination procedures†
Mathematical Structures in Computer Science
Theoretical Computer Science
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Triangular norm based predicate fuzzy logics
Fuzzy Sets and Systems
Dual tableau for monoidal triangular norm logic MTL
Fuzzy Sets and Systems
Hi-index | 0.00 |
Monoidal t-norm based logic MTL is the logic of left continuous t-norms. We introduce two analytic calculi for first-order MTL. These are obtained by lifting two sequent calculi for different fragments of this logic to the hypersequent level with subsequent addition of Avron's communication rule. Our calculi enable to prove the mid(hyper)sequent theorem. As corollaries follow Herbrand's theorem for first-order MTL, the decidability of its ∀∃-fragment and admissibility of Skolemization.