Abstract
AbstractBuilding on early work by Girard (1987) and using closely related techniques from the proof theory of many-valued logics, we propose a sequent calculus capturing a hierarchy of notions of satisfaction based on the Strong Kleene matrices introduced by Barrio et al. (Journal of Philosophical Logic 49:93–120, 2020) and others. The calculus allows one to establish and generalize in a very natural manner several recent results, such as the coincidence of some of these notions with their classical counterparts, and the possibility of expressing some notions of satisfaction for higher-level inferences using notions of satisfaction for inferences of lower level. We also show that at each level all notions of satisfaction considered are pairwise distinct and we address some remarks on the possible significance of this (huge) number of notions of consequence.
Funder
Deutsche Forschungsgemeinschaft
Eberhard Karls Universität Tübingen
Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. Baaz, M., Fermüller, C.G., & Salzer, G. (2001). Automated deduction for Many-Valued logics. In J.A. Robinson A. Voronkov (Eds.) Handbook of automated reasoning, (Vol. II pp. 1355–1402). Elsevier.
2. Barrio, E., Rosenblatt, L., & Tajer, D. (2015). The logics of strict-tolerant logic. Journal of Philosophical Logic, 44(5), 551–571.
3. Barrio, E.A., Pailos, F., & Szmuc, D. (2020). A hierarchy of classical and paraconsistent logics. Journal of Philosophical Logic, 49, 93–120.
4. Brünnler, T. (2006). Deep sequent systems for modal logic’. Advances in Modal Logic AiML, 6, 107–119.
5. Carrara, M., & Martino, E. (2014). Logical consequence and conditionals from a dialethic perspective. Logique & Analyse, 227, 359–378.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献