scientific article; zbMATH DE number 1140581
Knowing the truth-values of the components of an arbitrary conditional is not enough for evaluating it: this is emphasized by material implication's paradoxes. So lots of systems, rejecting these paradoxes, obey a relevance principle that says that a conditional can be true only if there is some connection between its antecedent and its consequent. The connections involved are either based on the notion of deductibility or on the notion of containment: In the first approach, the logical systems satisfy a principle which requires that \(A\) be actually used in some deduction of \(B\) for \(A\to B\) to be valid. Among such systems are J. Myhill's real implication system and the logics of relevance and necessity, \(R\) and \(E\), defined by Anderson and Belnap. The second approach links connection and containment. For example, in the system of Analytic Implication of Parry, in order to have \(A\) imply \(B\), every concept occurring in \(B\) must also occur in \(A\). Similarly, in Anderson and Belnap's systems, antecedent and consequent of valid conditionals must share variables. In this paper, we consider dependence logics in which valid implications must contain only arguments with related subject matters or topics. The propositional aspect of these logics is well known thanks to Epstein's work. However, few works have been done for the first-order case. Here, we present sequent first-order versions of dependence logics. For the entire collection see [Zbl 0885.00030].
- Tableaux for logics of content relationship and set-assignment semantics
- Generalized quantifiers in dependence logic
- Quantitative deduction and its fixpoint theory
- scientific article; zbMATH DE number 4037819 (Why is no real title available?)
- scientific article; zbMATH DE number 4061208 (Why is no real title available?)
- scientific article; zbMATH DE number 2062214 (Why is no real title available?)
- Quantales and structural rules
- Characterizing quantifier extensions of dependence logic
- History of relating logic. The origin and research directions
- Expressivity and Complexity of Dependence Logic
- Dependence statements are strict conditionals
- Foundations for entailment checking in quantitative separation logic
- Some deductive systems for content relationship logics
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 Q4385351)