Abstract
We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this logic. The semantics is defined in terms of a \(p\)-matrix built on top of a 5-valued extension of the 3-element weak Kleene algebra, whereas the calculus is defined in terms of a Gentzen-style sequent system where the left and right negation rules are subject to linguistic constraints.
Publisher
Uniwersytet Lodzki (University of Lodz)
Reference44 articles.
1. A. Anderson, N. Belnap, Entailment: The Logic of Relevance and Neccessity, vol. 1, Princeton University Press, Princeton (1975).
2. G. Badia, Variable sharing in substructural logics: an algebraic characterization, Bulletin of the Section of Logic, vol. 47(2) (2018), pp. 107–115, DOI: https://doi.org/10.18778/0138-0680.47.2.03
3. E. Barrio, F. Pailos, D. Szmuc, A Hierarchy of Classical and Paraconsistent Logics, Journal of Philosophical Logic, vol. 1(49) (2020), pp. 93–120, DOI: https://doi.org/10.1007/s10992-019-09513-z
4. N. Belnap, How a Computer Should Think, [in:] G. Ryle (ed.), Contemporary Aspects of Philosophy, Oriel Press, Stocksfield (1977), pp. 30–55.
5. F. Berto, Simple hyperintensional belief revision, Erkenntnis, vol. 84(3) (2019), pp. 559–575, DOI: https://doi.org/10.1007/s10670-018-9971-1
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献