Abstract
AbstractThe main goal of this paper is to provide an abstract framework for constructing proof systems for various many-valued logics. Using the framework it is possible to generate strongly complete proof systems with respect to any finitely valued deterministic and non-deterministic logic. I provide a couple of examples of proof systems for well-known many-valued logics and prove the completeness of proof systems generated by the framework.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Logic
Reference29 articles.
1. Avron, Z.: Non-deterministic semantics for logical systems. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 16. Springer, Amsterdam (2011)
2. Avron, A., Ben-Naim, J., Konikowska, B.: Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics. Log. Univ. 1(1), 41–70 (2007)
3. Avron, A., Konikowska, B.: Multi-valued calculi for logics based on non-determinism. Log. J. IGPL 13(4), 365–387 (2005)
4. Avron, A., Lev, I.: Canonical propositional Gentzen-type systems. In: Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18–23, 2001 Proceedings (Lecture Notes in Computer Science), pp. 529–544. Springer, Berlin (2001)
5. Avron, A., Lev, I.: Non-deterministic multiple-valued structures. J. Log. Comput. 15(3), 241–261 (2005)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献