Effective Finite-Valued Semantics for Labelled Calculi
We provide a systematic and modular method to define non-deterministic finite-valued semantics for a natural and very general family of canonical labelled calculi, of which many previously studied sequent and labelled calculi are particular instances. This semantics is effective, in the sense that it naturally leads to a decision procedure for these calculi. It is then applied to provide simple decidable semantic criteria for crucial syntactic properties of these calculi, namely (strong) analyticity and cut-admissibility.
KeywordsTruth Table Sequent Calculus Logical Connective Paraconsistent Logic Introduction Rule
Unable to display preview. Download preview PDF.
- 2.Avron, A., Lev, I.: Non-deterministic Multiple-valued Structures. Journal of Logic and Computation 15 (2005)Google Scholar
- 5.Avron, A., Konikowska, B., Zamansky, A.: Modular Construction of Cut-Free Sequent Calculi for Paraconsistent Logics. To Appear in Proceedings of Logic in Computer Science (LICS 2012) (2012)Google Scholar
- 8.Gabbay, D.M.: Labelled Deductive Systems, Volume 1. Oxford Logic Guides, vol. 33. Clarendon Press/Oxford Science Publications, Oxford (1996)Google Scholar
- 9.Lahav, O.: Non-deterministic Matrices for Semi-canonical Deduction Systems. To Appear in Proceedings of IEEE 42nd International Symposium on Multiple-Valued Logic (ISMVL 2012) (2012)Google Scholar
- 11.Stachniak, Z.: Resolution Proof Systems: An Algebraic Theory. Kluwer Academic Publishers (1996)Google Scholar