Some deductive systems for content relationship logics
Journal of Logic and Computation · 18.06.2026 · 36 (5)
DOI: 10.1093/logcom/exag019 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Logic and Computation, online erschienen am 25.06.2026. Verfasst von Mateusz Klonowski. Die Arbeit nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Centre, Poland.
Abstract (Originalsprache)
In the paper, we present deductive systems for Richard L. Epstein’s logics of content relationship. In our presentation, we focus on the logic $\mathbf{S}$ and the logic $\mathbf{D}$. The second one is also known as the logic of demodalized Parry’s analytic implication. These systems include two understandings of content relationship: the system $\mathbf{S}$ as having shared content and the system $\mathbf{D}$ as containment of contents. In the paper, for each of the considered logics, we discuss two systems of deduction. For the first type of system, we use restrictions on variable sets, and for the second, special rules that can capture the dependence of variable sets. The systems we focus on are based on the tree proofs. The completeness theorems are obtained by deriving all axioms of axiomatic systems of the analysed logics. To prove the soundness theorem, we present translations of the considered logics into the monadic predicate logic.
Förderung
- National Science Centre, Poland
Zitieren
APA
Klonowski, M. (2026). Some deductive systems for content relationship logics. Journal of Logic and Computation, 36(5). https://doi.org/10.1093/logcom/exag019
Vancouver
Klonowski M. Some deductive systems for content relationship logics. Journal of Logic and Computation. 2026;36(5). doi:10.1093/logcom/exag019
BibTeX
@article{Klonowski2026,
author = {Klonowski, Mateusz},
title = {Some deductive systems for content relationship logics},
journal = {Journal of Logic and Computation},
year = {2026},
volume = {36},
number = {5},
doi = {10.1093/logcom/exag019}
}
EUVIMED