A Post-style proof of completeness theorem for symmetric relatedness Logic S
Keywords:normal forms, Post-style proof of completeness, relatedness logic, relating logic
One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph  we can find some open problems concerning relatedness logic, a Post-style completeness theorem for logic S is one of them. Our paper introduces a solution of this metalogical issue.
R. L. Epstein, (with the assistance and collaboration of: W. A. Camielli, I. M. L. D’Ottaviano, S. Krajewski, R. D. Maddux), The Semantic Foundtations of Logic. Volume 1: Propositional Logics, Springer Science+Business Media, Dordrecht (1990).
T. Jarmużek and B. Kaczkowski, On some Logic with a Relation Imposed on Formulae: Tableau System F, Bulletin of the Section of Logic, Vol. 43:1/2 (2014), pp. 53–72.
S. Krajewski, One or Many Logics? (Epstein’s Set-Assignement Semantics for Logical Calculi), The Journal of Non-Classical Logic 8:1 (1991), pp. 7–33.
How to Cite
Copyright (c) 2018 Bulletin of the Section of Logic
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.