The method of hypersequents in the proof theory of propositional non-classical logics
Logic: from foundations to applications
Ordered chaining calculi for first-order theories of transitive relations
Journal of the ACM (JACM)
Analytic Calculi for Projective Logics
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
MUltlog 1.0: Towards an Expert System for Many-Valued Logics
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Automated deduction for many-valued logics
Handbook of automated reasoning
Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic
ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
T-norm-based logics with an independent involutive negation
Fuzzy Sets and Systems
Analytic Calculi for Logics of Ordinal Multiples of Standard t-Norms
Journal of Logic and Computation
Archive for Mathematical Logic
| Hi-index | 5.23 |
We extend the methodology in Baaz and Fermuller (1999) [5] to systematically construct analytic calculi for semi-projective logics-a large family of (propositional) locally finite many-valued logics. Our calculi, defined in the framework of sequents of relations, are proof search oriented and can be used to settle the computational complexity of the formalized logics. As a case study we derive sequent calculi of relations for Nilpotent Minimum logic and for Hajek's Basic Logic extended with the n-contraction axiom (n=1). The introduced calculi are used to prove that the decidability problem in these logics is Co-NP complete.