scientific article; zbMATH DE number 4061209

From MaRDI portal
Publication:3795657





The logics of relatedness (S) and dependence (D) attempt to formalize the relations of ``A is related to B and ``A depends on B. In the case of S, it is possible to formalize ``A is related to B by a new connective R added to the language of classical propositional calculus in such a way that, if \({\mathcal L}\) is the new language, then: 1) R(A,B) is true iff A is related to B, and 2) A*B is true (where * is \(\vee\), \(\wedge\), \(\neg\), \(\to\), and A, B are formulas of \({\mathcal L}\) composed from \(\vee\), \(\wedge\), \(\neg\), \(\to\), R) iff its components are related and the formula itself is true according to *. The paper gives a syntactical analysis of S, representing a simple and intuitively clear tableau-system for S. It is proved that certain proof- theoretical properties like compactness, theoremhood-decidability and a version of the theorem of cut-elimination hold for S. Extensions of this analysis to other similar systems (like dependence and dual-dependence logics) are discussed, as well as some problems related to those systems. This article is a companion of ``The algebra of dependence logic by \textit{R. L. Epstein} [reviewed above (see Zbl 0651.03020)].




Cited in
(22)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795657)